Journal
COMPUTERS & INDUSTRIAL ENGINEERING
Volume 108, Issue -, Pages 57-69Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2017.04.002
Keywords
Computational complexity; Heuristics; No-wait flow shop; Total completion time
Funding
- Agency for Healthcare Research and Quality [R03H5024633]
- UK HeathCare
- Haskayne School of Business at University of Calgary
Ask authors/readers for more resources
No-wait flow shop production has been widely applied in manufacturing. However, minimization of total completion time for no-wait flow shop production is NP-complete. Consequently, achieving good effectiveness and efficiency is a challenge in no-wait flow shop scheduling, where effectiveness means the deviation from optimal solutions and efficiency means the computational complexity or computation time. We propose a current and future idle time (CFI) constructive heuristic for no-wait flow shop scheduling to minimize total completion time. To improve effectiveness, we take current idle times and future idle times into consideration and use the insertion and neighborhood exchanging techniques. To improve efficiency, we introduce an objective increment method and determine the number of iterations to reduce the computation time. Compared with three recently developed heuristics, our CFI heuristic can achieve greater effectiveness in less computation time based on Taillard's benchmarks and 600 randomly generated instances. Moreover, using our CFI heuristic for operating room (OR) scheduling, we decrease the average patient flow times by 11.2% over historical ones in University of Kentucky Health Care (UKHC). (C) 2017 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available