Dominance properties for permutation flow shop problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2002

Dominance properties for permutation flow shop problems

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.
Not file

Dates and versions

inria-00100966 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00100966 , version 1

Cite

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⟩
98 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More