Article ID: | iaor20071774 |
Country: | United Kingdom |
Volume: | 57 |
Issue: | 5 |
Start Page Number: | 541 |
End Page Number: | 551 |
Publication Date: | May 2006 |
Journal: | Journal of the Operational Research Society |
Authors: | Gupta J.N.D., Stafford E.F., Tseng F.T. |
Keywords: | heuristics |
This paper considers the permutation flowshop scheduling problem with sequence-dependent set-up times and develops a penalty-based heuristic algorithm to find an approximately minimum makespan schedule. The proposed algorithm determines the penalty in time associated with a particular sequence and selects the sequence with the minimum time penalty as the best heuristic solution. Computational results comparing the effectiveness and efficiency of the proposed penalty-based heuristic algorithm with an existing savings index heuristic algorithm are reported and discussed.