Article ID: | iaor1999152 |
Country: | Netherlands |
Volume: | 90 |
Issue: | 2 |
Start Page Number: | 227 |
End Page Number: | 237 |
Publication Date: | Apr 1996 |
Journal: | European Journal of Operational Research |
Authors: | Tadei R., Croce F. Della, Narayan V. |
Keywords: | programming: branch and bound |
In this paper we study the NP-hard scheduling problem of minimizing total completion time in a two-machine flow shop. Five known lower bounds are discussed and two new ones are presented. A new dominance criterion is also proposed. Several versions of a branch and bound method are derived by applying, both individually and combined, these lower bounds. A heuristic procedure is also presented that uses a constructive O(