Article ID: | iaor1999153 |
Country: | Netherlands |
Volume: | 90 |
Issue: | 2 |
Start Page Number: | 238 |
End Page Number: | 251 |
Publication Date: | Apr 1996 |
Journal: | European Journal of Operational Research |
Authors: | Carlier Jacques, Reba Ismal |
Keywords: | programming: branch and bound |
The objective of this paper is to present two exact methods for the permutation flow shop problem. The first method is based on immediate selections and optimal adjustments of heads and tails. The second method consists in recursively enumerating jobs potentially processed first (inputs) and jobs which would be processed last (outputs) on machines. It is found that this second method gives better results than the first. However, the first method becomes more efficient when initial heads and tails are added.