| Article ID: | iaor20052553 |
| Country: | France |
| Volume: | 34 |
| Issue: | 1 |
| Start Page Number: | 1 |
| End Page Number: | 25 |
| Publication Date: | Jan 2000 |
| Journal: | RAIRO Operations Research |
| Authors: | Carlier James, Neron Emmanuel |
| Keywords: | programming: branch and bound |
The aim of this paper is to present a new branch and bound method for solving the Multi-Processor Flow-Shop. This method is based on the relaxation of the initial problem to m-machine problems corresponding to centers. Release dates and tails are associated with operations and machines. The branching scheme consists in fixing the inputs of a critical center and the lower bounds are those of the m-machine problem. Several techniques for adjusting release dates and tails have also been introduced. As shown by our personal study, the overall method is very efficient.