Article ID: | iaor19962035 |
Country: | United Kingdom |
Volume: | 46 |
Issue: | 11 |
Start Page Number: | 1365 |
End Page Number: | 1373 |
Publication Date: | Nov 1995 |
Journal: | Journal of the Operational Research Society |
Authors: | Khumawala B.M., Gupta J.N.D., Das S.R. |
This paper considers the permutation flowshop scheduling problem with significant sequence dependent set-up times and develops a savings index heuristic algorithm to find an approximately minimum makespan schedule. The proposed algorithm determines the savings in time associated with a particular sequence and selects the sequence with the maximum time savings as the best heuristic solution. Computational experience indicating the effectiveness and efficiency of the proposed savings index heuristic algorithm are reported and discussed.