Skip to Main content Skip to Navigation
Conference papers

Cyclic Job Shop Problem with varying processing times

Abstract : 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.
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download
Contributor : Laurence Porte Connect in order to contact the contributor
Submitted on : Monday, October 30, 2017 - 9:08:59 PM
Last modification on : Wednesday, November 3, 2021 - 6:35:46 AM
Long-term archiving on: : Wednesday, January 31, 2018 - 1:44:36 PM


Publication funded by an institution



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⟩



Les métriques sont temporairement indisponibles