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

Cited literature [31 references]  Display  Hide  Download

https://hal-emse.ccsd.cnrs.fr/emse-00707504
Contributor : Olivier Guyon <>
Submitted on : Tuesday, June 12, 2012 - 5:30:38 PM
Last modification on : Thursday, October 17, 2019 - 12:36:32 PM
Long-term archiving on : Thursday, September 13, 2012 - 2:35:42 AM

File

JobShop_ETP.pdf
Files produced by the author(s)

Identifiers

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⟩

Share

Metrics

Record views

542

Files downloads

970