Solving an integrated job-shop problem with human resource constraints |
| |
Authors: | Olivier Guyon Pierre Lemaire Éric Pinson David Rivreau |
| |
Institution: | 1. école des Mines de Saint-étienne, Centre Microélectronique de Provence, 880 avenue de Mimet, 13541, Gardanne, France 2. Grenoble-INP/UJF-Grenoble 1/CNRS, G-SCOP UMR5272, Université de Grenoble, 46 avenue Félix Viallet, 38031, Grenoble cedex, France 3. LUNAM Université, Université catholique de l’Ouest–UCO, LISA EA4094, 3 place André Leroy, B.P. 10808, 49008, Angers cedex 01, France
|
| |
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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|