Solving an integrated job-shop problem with human resource constraints - Mines Saint-Étienne Access content directly
Journal Articles Annals of Operations Research Year : 2014

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.
Fichier principal
Vignette du fichier
JobShop_ETP.pdf (221.18 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

emse-00707504 , version 1 (12-06-2012)

Identifiers

Cite

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

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More