CP 2003: Principles and Practice of Constraint Programming – CP 2003 pp 153-167 | Cite as
hibiscus: A Constraint Programming Application to Staff Scheduling in Health Care
Conference paper
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.
Keywords
Schedule Problem Work Shift Constraint Programming Night Shift Global Constraint
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.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)Google Scholar
- 2.Beaulieu, H.: Planification de l’horaire des médecins dans une salle d’urgence. Master’s thesis, Université de Montréal, Canada (1998)Google Scholar
- 3.Bourdais, S.: Génération automatique d’horaires dans le milieu hospitalier. Master’s thesis, École Polytechnique de Montréal, Canada (2003)Google Scholar
- 4.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)Google Scholar
- 5.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)Google Scholar
- 6.Carter, M.W., Lapierre, S.D.: Scheduling Emergency Room Physicians. Health Care Management Science 4, 347–360 (2001)CrossRefGoogle Scholar
- 7.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)Google Scholar
- 8.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)CrossRefGoogle Scholar
- 9.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)Google Scholar
- 10.Forget, F.: Confection automatisée des horaires de médecins dans une salle d’urgence. Master’s thesis, Université de Montréal, Canada (2002)Google Scholar
- 11.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)Google Scholar
- 12.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)Google Scholar
- 13.Pesant, G.: The Pattern Constraint (in preparation)Google Scholar
- 14.Pesant, G.: A Filtering Algorithm for the Stretch Constraint. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 183–195. Springer, Heidelberg (2001)CrossRefGoogle Scholar
- 15.Régin, J.-C.: Generalized Arc Consistency for Global Cardinality Constraints. In: Proc. of AAAI 1996, pp. 209–215. AAAI Press/MIT Press (1996)Google Scholar
- 16.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)CrossRefGoogle Scholar
- 17.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)Google Scholar
- 18.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)Google Scholar
- 19.Warner, D.M.: Scheduling Nursing Personnel According to Nursing Preference: A Mathematical Programming Approach. Operations Research 24, 842–856 (1976)MATHCrossRefGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2003