Abstract
This paper presents a constraint programming model and search strategy to formulate and solve staff scheduling problems in health care. This is a well-studied problem for which many different approaches have been developed over the years but it remains a challenge to successfully apply any given instance of a method to the various contexts encountered. We show how the main categories of rules involved may be expressed using global constraints. We describe a modular architecture for heuristic search. The resulting flexible and rather general constraint programming approach is evaluated on benchmark problems from different hospitals and for different types of personnel.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abdennadher, S., Schenker, H.: INTERDIP - An Interactive Constraint Based Nurse Scheduler. In: The First International Conference and Exhibition on The Practical Application of Constraint Technologies and Logic Programming - PACLP 1999 (1999)
Beaulieu, H.: Planification de l’horaire des médecins dans une salle d’urgence. Master’s thesis, Université de Montréal, Canada (1998)
Bourdais, S.: Génération automatique d’horaires dans le milieu hospitalier. Master’s thesis, École Polytechnique de Montréal, Canada (2003)
Buzon, I., Lapierre, S.D.: A Tabu Search Algorithm to Schedule Emergency Room Physicians. Technical report, Centre de Recherche sur les Transports, Montréal, Canada (1999)
Cantera, I.E.B.: La confection des horaires de travail des médecins d’urgence résolue à l’aide de la recherche tabou. Master’s thesis, Université de Montréal, Canada (2001)
Carter, M.W., Lapierre, S.D.: Scheduling Emergency Room Physicians. Health Care Management Science 4, 347–360 (2001)
Chan, P., Heus, K., Weil, G.: Nurse Scheduling with Global Constraints in CHIP: GYMNASTE. In: Conference on Practical Applications of Constraint Technology, London, UK (1998)
Cheng, B.M.W., Lee, J.H.M., Wu, J.C.K.: A Constraint-Based Nurse Rostering System Using a Redundant Modeling Approach. In: Eight International Conference on Tools with Artificial Intelligence - TAI 1996, pp. 140–148. IEEE Computer Society Press, Los Alamitos (1996)
Darmoni, S.J., Fajner, A., Mahe, N., Leforestier, A., Vondracek, M., Stelian, O., Baldenweck, M.: Horoplan: computer-assisted nurse scheduling using contraintbased programming. Journal of the Society for Health Systems 5, 41–54 (1995)
Forget, F.: Confection automatisée des horaires de médecins dans une salle d’urgence. Master’s thesis, Université de Montréal, Canada (2002)
Labit, P.: IRIS: Amélioration d’une méthode de génération de colonnes pour la confection d’horaires d’infirmières. Master’s thesis, École Polytechnique de Montréal, Canada (2000)
Meyer, H., Hofe, A.: Nurse rostering as constraint satisfaction with fuzzy constraints and inferred control strategies. In: Freuder, E.C., Wallace, R.J. (eds.) Constraint Programming and Large Scale Optimisation Problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science (2000)
Pesant, G.: The Pattern Constraint (in preparation)
Pesant, G.: A Filtering Algorithm for the Stretch Constraint. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 183–195. Springer, Heidelberg (2001)
Régin, J.-C.: Generalized Arc Consistency for Global Cardinality Constraints. In: Proc. of AAAI 1996, pp. 209–215. AAAI Press/MIT Press (1996)
Régin, J.-C., Puget, J.-F.: A Filtering Algorithm for Global Sequencing Constraints. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 32–46. Springer, Heidelberg (1997)
Rousseau, L.-M., Pesant, G., Gendreau, M.: A Hybrid Algorithm to Solve a Physician Rostering Problem. In: Second Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Paderborn, Germany (2000)
Saadie, M.: Planification de l’horaire des médecins dans une salle d’urgence par la programmation par contraintes. Master’s thesis, Université de Montréal, Canada (2003)
Warner, D.M.: Scheduling Nursing Personnel According to Nursing Preference: A Mathematical Programming Approach. Operations Research 24, 842–856 (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bourdais, S., Galinier, P., Pesant, G. (2003). hibiscus: A Constraint Programming Application to Staff Scheduling in Health Care. In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-45193-8_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20202-8
Online ISBN: 978-3-540-45193-8
eBook Packages: Springer Book Archive