An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs |
| |
| Institution: | 1. Industrial Engineering and Management Division, Department of Humanities and Social Sciences, Indian Institute of Technology, Madras 600 036, India;2. Faculty of Business Administration and Economics, Department of Production Management, University of Passau, Dr.-Hans-Kapfinger-Str. 30, 94032 Passau, Germany;1. Department of Medicine, University of Florida, Gainesville;2. Division of Cardiovascular Disease, Department of Medicine, University of Florida, Gainesville;3. Department of Epidemiology, Graduate School of Public Health, University of Pittsburgh, Pittsburgh, PA;4. Department of Medicine, University of Pittsburgh, Pa;5. Cardiovascular Institute, Allegheny General Hospital, Pittsburgh, Pa;6. Rhode Island Hospital, Providence;7. Division of Cardiovascular Disease, Department of Medicine, University of Alabama at Birmingham;8. Division of Heart and Vascular Diseases, National Heart, Lung and Blood Institute, National Institute of Health, Bethesda, Md;9. Barbra Streisand Women''s Heart Center, Cedars-Sinai Heart Institute, Los Angeles, Calif;10. Division of Cardiovascular Disease, Department of Medicine, Dartmouth-Hitchcock Medical Center, Lebanon, NH;1. Division of Urology, Brigham and Women''s Hospital, Harvard Medical School, 45 Francis Street, Boston, MA 02115, USA;2. Department of Radiation Oncology, Brigham and Women''s Hospital, Harvard Medical School, 45 Francis Street, Boston, MA 02115, USA;3. Dana-Farber Cancer Institute, Harvard Medical School, Boston, MA, USA;1. Department of Industrial Engineering, Kangwon National University, Chunchon 200-701, Republic of Korea;2. Kaiem Co., LTD., Seoul 152-780, Republic of Korea;3. School of Information Engineering, Dalian Ocean University, Dalian 116023, China;4. School of Information Science and Technology, Dalian Maritime University, Dalian 116026, China;5. Institute for Neural Computation, University of California San Diego, La Jolla, CA 92093, USA;1. Higher Institute of Management of Tunis, Tunis University, 41, Liberty Street - Bouchoucha - 2000 Bardo, Tunisie;2. Institute of Advanced Business Studies of Carthage, Carthage University, IHEC Carthage Presidency-2016 Tunis, Tunisie |
| |
| Abstract: | The problem of scheduling in a flowshop is considered with the objective of minimizing the total weighted flowtime of jobs. A heuristic algorithm is developed by the introduction of lower bounds on the completion times of jobs and the development of heuristic preference relations for the scheduling problem under study. An improvement scheme is incorporated in the heuristic to enhance the quality of its solution. The proposed heuristic, with and without the improvement scheme, and the existing heuristics are evaluated by a large number of randomly generated problems. The results of an extensive computational investigation for various problem sizes are presented. It has been observed that both versions of the proposed heuristic perform better than the existing heuristics in giving a superior solution quality and that the proposed heuristic without the improvement scheme yields a good solution by requiring a negligible CPU time. In addition, an experimental investigation is carried out to evaluate the effectiveness of the improvement scheme when implemented in the proposed heuristic and the existing heuristics, as well as the effectiveness of a variant of the scheme. The results are also discussed. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
