Cyclic Job Shop Problem with varying processing times - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Cyclic Job Shop Problem with varying processing times

(1) , (1) , (2)


In this paper, we consider a cyclic job shop problem where a subset of tasks have varying processing times. The minimum processing times and maximum processing times of these tasks are known. We propose a branch and bound method that finds the schedule which minimizes the mean cycle time with respect to variations. We show that the evaluation of a schedule can be considered as a volume calculus of some polytopes. Indeed, for each schedule we can associate a set of polytopes whose volumes provide information on the variation effect on the considered schedule.
Fichier principal
Vignette du fichier
cafieri.pdf.pdf (427.95 Ko) Télécharger le fichier
Origine : Publication financée par une institution

Dates et versions

hal-01626534 , version 1 (30-10-2017)



Idir Hamaz, Laurent Houssin, Sonia Cafieri. Cyclic Job Shop Problem with varying processing times. IFAC 2017, 20th World Congress of the International Federation of Automatic Control, Jul 2017, Toulouse, France. pp.5012 - 5016, ⟨10.1016/j.ifacol.2017.08.908⟩. ⟨hal-01626534⟩
166 Consultations
135 Téléchargements



Gmail Facebook Twitter LinkedIn More