Abstract
The nurse rostering problem consists in assigning working shifts to each nurse on each day for a certain period of time. In particular, for the Valparaíso Clinic Center, the problem comprises about 1600 assignments that must consider requirements related to minimal area or floor allocation as well as legal regulations. This planning is a difficult and time consuming task that currently is done by hand yielding often unsatisfactory results. In this paper, we provide a description of such a real-world problem and we show how it can be modeled and solved with constraint programming. Using this approach we provide an automatic generation of such rosters in a few seconds instead of by hand in some days.
Chapter PDF
Similar content being viewed by others
Keywords
References
Abdennadher, S., Schlenker, H.: Nurse Scheduling using Constraint Logic Programming. In: Proceedings of AAAI/IAAI, pp. 838–843 (1999)
Aickelin, U., Dowsland, K.A.: An Indirect Genetic Algorithm for a Nurse-Scheduling Problem. Computers & OR 31(5), 761–778 (2004)
Aickelin, U., Dowsland, K.A.: Exploiting Problem Structure in a Genetic Algorithm Approach to a Nurse Rostering Problem. Journal of Scheduling 3(3), 139–153 (2001)
Burke, E., Causmaecker, P.D., Berghe, G.V.: A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem. In: McKay, B., Yao, X., Newton, C.S., Kim, J.-H., Furuhashi, T. (eds.) SEAL 1998. LNCS (LNAI), vol. 1585, pp. 187–194. Springer, Heidelberg (1999)
Crawford, B., Castro, C., Monfroy, E.: A Constructive Hybrid Algorithm for Crew Pairing Optimization. In: Euzenat, J., Domingue, J. (eds.) AIMSA 2006. LNCS (LNAI), vol. 4183, pp. 45–55. Springer, Heidelberg (2006)
Dowsland, K.A.: Nurse Scheduling with Tabu Search and Strategic Oscillation. European Journal of Operational Research 106, 393–407 (1998)
Rossi, F.: Handbook of Constraint Programming. Elsevier, Amsterdam (2006)
Jaffar, J., Maher, M.J.: Constraint logic programming: A survey. J. Log. Program. 19(20), 503–581 (1994)
Métivier, J.-P., Boizumault, P., Loudni, S.: Solving Nurse Rostering Problems Using Soft Global Constraints. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 73–87. Springer, Heidelberg (2009)
Miller, H.E., William, P., Gustave, J.R.: Nurse Scheduling Using Mathematical Programming. Operations Research 24(5), 857–870 (1976)
Semet, F., Vovor, T., Jaumard, B.: A Generalized Linear Programming Model for Nurse Scheduling. European Journal of Operational Research 107, 1–18 (1998)
Thomson, G.M.: A Simulated Annealing Heuristic for Shift-Scheduling Using Non-Continuously Available Employees. Computers and Operations Research 23, 275–288 (1996)
Warner, D.M., Prawda, J.: A Mathematical Programming Model for Scheduling Nursing Personnel in a Hospital. Management Science 19(4), 411–422 (1972)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pizarro, R., Rivera, G., Soto, R., Crawford, B., Castro, C., Monfroy, E. (2011). Constraint-Based Nurse Rostering for the Valparaíso Clinic Center in Chile. In: Stephanidis, C. (eds) HCI International 2011 – Posters’ Extended Abstracts. HCI 2011. Communications in Computer and Information Science, vol 174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22095-1_90
Download citation
DOI: https://doi.org/10.1007/978-3-642-22095-1_90
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22094-4
Online ISBN: 978-3-642-22095-1
eBook Packages: Computer ScienceComputer Science (R0)