Solving Nurse Rostering Problems Using Soft Global Constraints - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Solving Nurse Rostering Problems Using Soft Global Constraints

Résumé

Nurse Rostering Problems (NRPs) consist of generating rosters where required shifts are assigned to nurses over a scheduling period satisfying a number of constraints. Most NRPs in real world are NP-hard and are particularly challenging as a large set of different constraints and specific nurse preferences need to be satisfied. The aim of this paper is to show how NRPs can be easily modelled and efficiently solved using soft global constraints. Experiments on real-life problems and comparison with ad'hoc OR approaches are detailed.
Fichier principal
Vignette du fichier
ACTI-METIVIER-2009-2.pdf (6.96 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01015106 , version 1 (25-06-2014)

Identifiants

  • HAL Id : hal-01015106 , version 1

Citer

Jean-Philippe Metivier, Patrice Boizumault, Samir Loudni. Solving Nurse Rostering Problems Using Soft Global Constraints. 15th International Conference on Principles and Practice of Constraint Programming (CP'09), Sep 2009, Lisbon, Portugal, France. pp.73--87. ⟨hal-01015106⟩
156 Consultations
246 Téléchargements

Partager

Gmail Facebook X LinkedIn More