Cyclic Job Shop Problem with varying processing times

Idir Hamaz (1) , Laurent Houssin (1) , Sonia Cafieri (2)

1 LAAS-ROC - Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes
2 ENAC - Ecole Nationale de l'Aviation Civile

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.

Domaines: Mathématiques [math]; Optimisation et contrôle [math.OC]; Informatique [cs]; Recherche opérationnelle [cs.RO]

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⟩