Abstract : We are interested here in new sub cases for which permutation flow shop schedules are dominant while considering the classical flow shop scheduling problem and the makespan criterion. To obtain these sub cases, we introduce conditions on the lower and upper bounds of the processing times. These conditions can be quite realistic when the corresponding line is balanced.
https://hal.inria.fr/inria-00100966
Contributeur : Publications Loria
<>
Soumis le : mardi 26 septembre 2006 - 14:53:12
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48
Marie-Claude Portmann, Mikhail Y. Kovalyov, Henri Amet. Dominance properties for permutation flow shop problems. Eighth International Workshop on Project Management and Scheduling, Apr 2002, Valencia, Spain, pp.297-300, 2002. 〈inria-00100966〉
