Comparison of Initial Solutions of Heuristics for No-wait Flow Shop Scheduling
No-wait flow shop scheduling problems have been proved to be NP-hard. Therefore, heuristics are considered as the most suitable ones for obtaining near optimal solutions and are generally developed in two phases namely, initial solution phase and improvement solution phase. We propose a method for obtaining the initial solution with a view to minimize total flow time. The exhaustive computational results reveal that the proposed method performs better than the existing heuristics with respect to both quality of solution and computational time.
KeywordsNo-wait flow shop scheduling Heuristics Initial sequence Total flow time
Unable to display preview. Download preview PDF.
- 8.Simons Jr., J.V.: Heuristics in flow shop scheduling with sequence dependent setup times. Int. J. Mgmt. Sci. 20, 215–225 (1992)Google Scholar