Skip to Main content Skip to Navigation
Conference papers

Dominance properties for permutation flow shop problems

Marie-Claude Portmann 1 Mikhail Y. Kovalyov Henri Amet 1
1 MACSI - Industrial system modeling, analysis and operation
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Document type :
Conference papers
Complete list of metadata
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 2:53:12 PM
Last modification on : Friday, February 26, 2021 - 3:28:04 PM


  • HAL Id : inria-00100966, version 1



Marie-Claude Portmann, Mikhail Y. Kovalyov, Henri Amet. Dominance properties for permutation flow shop problems. Eighth International Workshop on Project Management and Scheduling, Vincente Valls, Apr 2002, Valencia, Spain, pp.297-300. ⟨inria-00100966⟩



Record views