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.
Type de document :
Communication dans un congrès
IFAC 2017, 20th World Congress of the International Federation of Automatic Control, Jul 2017, Toulouse, France. 50 (1), pp.5012 - 5016, 2017, 〈10.1016/j.ifacol.2017.08.908〉
Liste complète des métadonnées

Littérature citée [22 références]  Voir  Masquer  Télécharger

https://hal-enac.archives-ouvertes.fr/hal-01626534
Contributeur : Laurence Porte <>
Soumis le : lundi 30 octobre 2017 - 21:08:59
Dernière modification le : mardi 11 septembre 2018 - 15:19:15
Document(s) archivé(s) le : mercredi 31 janvier 2018 - 13:44:36

Fichier

cafieri.pdf.pdf
Publication financée par une institution

Identifiants

Citation

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. 50 (1), pp.5012 - 5016, 2017, 〈10.1016/j.ifacol.2017.08.908〉. 〈hal-01626534〉

Partager

Métriques

Consultations de la notice

171

Téléchargements de fichiers

50