Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications |
| |
| Affiliation: | 1. Department of Mechanical and Industrial Engineering, College of Engineering and Petroleum, Kuwait University, P.O. Box 5969, Safat, Kuwait;2. Department of Computer Engineering, College of Engineering and Petroleum, Kuwait University, P.O. Box 5969, Safat, Kuwait;1. Research Unit on System Modeling for Industry, Department of Industrial Engineering, Faculty of Engineering, Khon Kaen University, Khon Kaen 40002, Thailand;2. Manufacturing Management Research Center, Faculty of Economics, University of Tokyo, Tokyo 113-0033, Japan;3. Fuzzy Logic Systems Institute, Iizuka, Fukuoka 820-0067, Japan;1. Department of Discrete Mathematics, Phystech School of Applied Mathematics and Informatics, Moscow Institute of Physics and Technology, Dolgoprudny, Russian Federation;2. Faculty of Mechanical and Electrical Engineering, Polish Naval Academy, Gdynia, Poland, 69 ?midowicza Street, Gdynia 81-127, Poland;1. Department of Industrial and Management Systems Engineering, Kuwait University, P.O. Box 5969, Safat, Kuwait;2. Department of Mathematics and Natural Sciences, Gulf University for Science and Technology, P.O. Box 7207, Hawally 32093, Kuwait;3. Department of Economics and Finance, Gulf University for Science and Technology, P.O. Box 7207, Hawally 32093, Kuwait;1. Computer Engineering Department, Iran University of Science & Technology (IUST), Tehran, Iran;2. Laboratoire d′Informatique de Paris 6, University of Pierre & Marie Curie (UPMC), Paris, France;1. School of Information Management and Engineering, Shanghai University of Finance and Economics, Shanghai, 200433, PR China;2. School of Economics & Management, Tongji University, Shanghai, 200092, PR China;3. Glorious Sun School of Business and Management, Donghua University, Shanghai, 200051, PR China |
| |
| Abstract: | The multimedia data objects scheduling problem for WWW applications is modeled using the two-machine flowshop problem of minimizing maximum lateness with separate setup times. We establish three dominance relations, and propose four heuristics. Also, we conduct computational experiments to compare the performance of the proposed heuristics and that of existing ones in the literature. The results of the computational experiments show that the proposed heuristics are quite efficient.Scope and purposeA two-machine flowshop scheduling problem involves scheduling a number of jobs on the machines in order to optimize a given criterion. The majority of research assumes that setup times are negligible or can be combined with the processing times. However, the latter assumption is invalid since it may lead to more idle time on the second machine. In the literature, the separate setup times problem has been mainly addressed with the completion-time-related objective functions such as makespan. However, there are many real-life situations in which a due-date-related objective function such as maximum lateness is more appropriate. The problem with maximum lateness objective has received limited attention from researchers as indicated by a recent survey paper. In this paper, we show a real-life situation in the Internet where the two-machine flowshop problem of minimizing maximum lateness with separate setup times can be used to model the multimedia object scheduling problem. We propose new improved heuristics for this problem and compare with existing ones in the literature. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
