Article ID: | iaor19911599 |
Country: | United Kingdom |
Volume: | 29 |
Issue: | 7 |
Start Page Number: | 1489 |
End Page Number: | 1502 |
Publication Date: | Jul 1991 |
Journal: | International Journal of Production Research |
Authors: | Tunc Enar A., Gupta Jatinder N.D. |
Approximate solution algorithms are developed to find a minimum makespan schedule in a two-stage hybrid flowshop when the second stage consists of multiple identical machines. Computational experience comparing the ‘approximate’ makespans with their respective global lower bounds for large problems indicates that proposed polynomially bounded approximate algorithms are quite effective. It is shown that the proposed heuristic algorithms can be used to improve the efficiency of an existing branch and bound algorithm.