Shift Design Personnel Task Scheduling Problem with Equity: Improving a constraint-based approach with a Large Neighborhood Search - Archive ouverte HAL
Pré-Publication, Document De Travail Année : 2016

Shift Design Personnel Task Scheduling Problem with Equity: Improving a constraint-based approach with a Large Neighborhood Search

Résumé

This paper introduces a new approach to solve the Shift-Design Personnel Task Scheduling Problem with an Equity criterion. This problem has been introduced in the context of drug evaluation, which requires to assign a set of medical tasks,fixed in time, to a set of skilled employees, whose shifts are to design. Employees' schedules must consider both legal and organizational constraints. The optimality criterion concerns the equity of the workload sharing. Two dedicated methods, one based on Constraint Programming and the other on a two-phase method, have been proposed in the literature to solve this problem. In this paper, we propose a new approach by improving the Constraint Programming model with a Large Neighborhood Search and we show that this new method clearly outperforms existing literature.
Fichier principal
Vignette du fichier
Lapegue_etal_16.pdf (403.37 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01421186 , version 1 (21-12-2016)

Identifiants

  • HAL Id : hal-01421186 , version 1

Citer

Tanguy Lapègue, Damien Prot, Odile Bellenguez-Morineau. Shift Design Personnel Task Scheduling Problem with Equity: Improving a constraint-based approach with a Large Neighborhood Search. 2016. ⟨hal-01421186⟩
311 Consultations
349 Téléchargements

Partager

More