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.
Document type :
Conference papers
Complete list of metadatas

https://hal-emse.ccsd.cnrs.fr/hal-00477252
Contributor : Pierre Lemaire <>
Submitted on : Thursday, September 30, 2010 - 4:50:08 PM
Last modification on : Friday, May 10, 2019 - 11:42:01 AM
Long-term archiving on : Friday, December 31, 2010 - 2:28:56 AM

Files

Identifiers

  • 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⟩

Share

Metrics

Record views

670

Files downloads

514