J. Carlier et I. Rebai, 2 BRANCH-AND-BOUND ALGORITHMS FOR THE PERMUTATION FLOW-SHOP PROBLEM, European journal of operational research, 90(2), 1996, pp. 238-251
Citations number
25
Categorie Soggetti
Management,"Operatione Research & Management Science
The objective of this paper is to present two exact methods for the pe
rmutation flow shop problem. The first method is based on immediate se
lections 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 fir
st. However, the first method becomes more efficient when initial head
s and tails are added.