Solving an integrated Job-Shop problem with human resource constraints

Abstract : This paper investigates the integration of the employee timetabling and production scheduling problems. At the first level, we have to manage a classical employee timetabling problem. At the second level, we aim at supplying a feasible production schedule for a job-shop scheduling problem (NP-hard problem). Instead of using a hierarchical approach as in the current practice, we here integrate the two decision stages and propose two exact methods for solving the resulting problem. The former is similar to the cut generation algorithm proposed in Guyon et. al. 2010) for a problem integrating a classical employee timetabling problem and a polynomially solvable production scheduling problem. The latter is based on a Branch-And-Cut process that exploits the same feasibility cuts than the first approach. Preliminar experimental results on instances proposed in (Artigues et al. 2009) reveal a real interest for the approaches described here.
Type de document :
Communication dans un congrès
PMS 2010, 12th International Workshop on Project Management and Scheduling, Apr 2010, Tours, France
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/hal-00477252
Contributeur : Pierre Lemaire <>
Soumis le : jeudi 30 septembre 2010 - 16:50:08
Dernière modification le : lundi 9 avril 2018 - 09:34:01
Document(s) archivé(s) le : vendredi 31 décembre 2010 - 02:28:56

Fichiers

Identifiants

  • HAL Id : hal-00477252, version 1

Citation

Olivier Guyon, Pierre Lemaire, Eric Pinson, David Rivreau. Solving an integrated Job-Shop problem with human resource constraints. PMS 2010, 12th International Workshop on Project Management and Scheduling, Apr 2010, Tours, France. 〈hal-00477252〉

Partager

Métriques

Consultations de la notice

407

Téléchargements de fichiers

377