Solving an integrated job-shop problem with human resource constraints

Abstract : We propose two exact methods to solve an integrated employee-timetable and job-shop-scheduling problem. The problem is to find a minimum cost employee-timetable, where employees have different competences and work during shifts, so that the production, that corresponds to a job-shop with resource availability constraints, can be achieved. We introduce two new exact procedures: (1) a decomposition and cut generation approach and (2) a hybridization of a cut generation process with a branch and bound strategy. We also propose initial cuts that strongly improve these methods as well as a standard MIP approach. The computational performances of those methods on benchmark instances are compared to that of other methods from the literature.
Type de document :
Article dans une revue
Annals of Operations Research, Springer Verlag, 2014, 213 (1), pp.147-171. 〈10.1007/s10479-012-1132-3〉
Liste complète des métadonnées

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

https://hal-emse.ccsd.cnrs.fr/emse-00707504
Contributeur : Olivier Guyon <>
Soumis le : mardi 12 juin 2012 - 17:30:38
Dernière modification le : lundi 9 avril 2018 - 09:34:01
Document(s) archivé(s) le : jeudi 13 septembre 2012 - 02:35:42

Fichier

JobShop_ETP.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Olivier Guyon, Pierre Lemaire, Eric Pinson, David Rivreau. Solving an integrated job-shop problem with human resource constraints. Annals of Operations Research, Springer Verlag, 2014, 213 (1), pp.147-171. 〈10.1007/s10479-012-1132-3〉. 〈emse-00707504〉

Partager

Métriques

Consultations de la notice

422

Téléchargements de fichiers

740