Nurse Rostering with Soft Constraints - Evidence from Chilean Mid-size Health Care Centers

Ricardo Soto, Broderick Crawford, Rodrigo Bertrand, Eric Monfroy

Abstract

Nurse rostering deals with the shifts arrangements of nursing staff in the daily operation of health care centers. The design of suitable rosters for nurses is known to be particularly complex due to the number of interrelated requirements that must be considered. The literature reports a wide list of works devoted to solve such a problem. The techniques used range from classic methods such as linear programming to more modern incomplete methods such as evolutionary computing. However, most works are centered on the performance of techniques for solving well-known instances of nurse rostering. In this paper, we focus on a real case study of nurse rostering. The solution is devoted to a set of mid-size Chilean hospitals that use a very uncommon shift pattern due to proper country legal regulations. We present a new model involving hard and soft constraints that can be applied generically to any chilean health care center.

References

  1. Abdennadher, S. and Schlenker, H. (1999). Nurse Scheduling using Constraint Logic Programming. In Proceedings of AAAI/IAAI, pages 838-843.
  2. Aickelin, U. and Dowsland, K. (2001). Exploiting Problem Structure in a Genetic Algorithm Approach to a Nurse Rostering Problem. Journal of Scheduling, 3(3):139- 153.
  3. Aickelin, U. and Dowsland, K. A. (2004). An Indirect Genetic Algorithm for a Nurse-Scheduling Problem. Computers & OR, 31(5):761-778.
  4. Bai, R., Burke, E., Kendall, G., Li, J., and McCollum, B. (2010). A hybrid evolutionary approach to the nurse rostering problem. IEEE Trans. Evolutionary Computation, 14(4):580-590.
  5. Bourdais, S., Galinier, P., and Pesant, G. (2003). Hibiscus: A constraint programming application to staff scheduling in health care. In Proceedings of CP, volume 2833 of LNCS, pages 153-167. Springer.
  6. Burke, E., Causmaecker, P. D., and Berghe, G. V. (1999). A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem. In Proceedings of SEAL, volume 1585 of LNCS, pages 187-194. Springer.
  7. Burke, E., Curtois, T., Post, G., Qu, R., and Veltman, B. (2008). A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. European Journal of Operational Research, 188(2):330-341.
  8. Burke, E., Curtois, T., Qu, R., and Berghe, G. V. (2010). A Scatter Search for the Nurse Rostering Problem. Journal of Operational Research Society, 61:1667-1679.
  9. C. Bessière (2006). Handbook of Constraint Programming, chapter Constraint Propagation, pages 29-84. Elsevier.
  10. Crawford, B., Castro, C., Monfroy, E., Soto, R., Palma, W., and Paredes, F. (2012). A hyperheuristic approach for guiding enumeration in constraint solving. In Proceedings of EVOLVE, volume 175 of Advances in Intelligent Systems and Computing, pages 171-188. Springer.
  11. Crawford, B., Soto, R., Castro, C., and Monfroy, E. (2011a). Extensible cp-based autonomous search. In Proceedings of HCI International, volume 173 of CCIS, pages 561-565. Springer.
  12. Crawford, B., Soto, R., Castro, C., and Monfroy, E. (2011b). A hyperheuristic approach for dynamic enumeration strategy selection in constraint satisfaction. In Proceedings of the 4th International Workconference on the Interplay Between Natural and Artificial Computation (IWINAC), volume 6687 of LNCS, pages 295-304. Springer.
  13. Crawford, B., Soto, R., Monfroy, E., Palma, W., Castro, C., and Paredes, F. (2013). Parameter tuning of a choice-function based hyperheuristic using particle swarm optimization. Expert Systems with Applications, 40(5):1690-1695.
  14. Crawford, B., Soto, R., Montecinos, M., Castro, C., and Monfroy, E. (2011c). A framework for autonomous search in the eclipse solver. In Proceedings of the 24th
  15. International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems (IEA/AIE), volume 6703 of LNCS, pages 79-84. Springer.
  16. Dowsland, K. (1998). Nurse scheduling with tabu search and strategic oscillation. European Journal of Operational Research, 106:393-407.
  17. Li, H., Lim, A., and Rodrigues, B. (2003). A hybrid ai approach for nurse rostering problem. In Proceedings of SAC, pages 730-735. ACM Press.
  18. L ü, Z. and Hao, J.-K. (2012). Adaptive neighborhood search for nurse rostering. European Journal of Operational Research, 218(3):865-876.
  19. Maenhout, B. and M.Vanhoucke (2011). An evolutionary approach for the nurse rerostering problem. Computers & OR, 38(10):1400-1411.
  20. Maenhout, B. and Vanhoucke, M. (2007). An electromagnetic meta-heuristic for the nurse scheduling problem. J. Heuristics, 13(4):359-385.
  21. Métivier, J.-P., Boizumault, P., and Loudni, S. (2009). Solving Nurse Rostering Problems Using Soft Global Constraints. In Proceedings of CP, volume 5732 of LNCS, pages 73-87. Springer.
  22. Miller, H., William, P., and Gustave, J. (1976). Nurse Scheduling Using Mathematical Programming. Operations Research, 24(5):857-870.
  23. Monfroy, E., Castro, C., Crawford, B., Soto, R., Paredes, F., and Figueroa, C. (2013). A reactive and hybrid constraint solver. Journal of Experimental and Theoretical Artificial Intelligence, 25(1):1-22.
  24. Pizarro, R., Rivera, G., Soto, R., Crawford, B., Castro, C., and Monfroy, E. (2011). Constraint-based nurse rostering for the valparaíso clinic center in chile. In HCI International Conference 2011, volume 174 of CCIS, pages 448-452. Springer.
  25. Qu, R. and He, F. (2008). A hybrid constraint programming approach for nurse rostering problems. In Proceedings of SGAI, pages 211-224.
  26. Qu, R. and He, F. (2009). Constraint-directed local search to nurse rostering problems. In Proceedings of the 6th International Workshop on Local Search Techniques in Constraint Satisfaction (LSCS), pages 69-80.
  27. Semet, F., Vovor, T., and Jaumard, B. (1998). A Generalized Linear Programming Model for Nurse Scheduling. European Journal of Operational Research, 107:1- 18.
  28. Soto, R., Crawford, B., Bertrand, R., and Monfroy, E. (2013). Modeling nrps with soft and reified constraints. In Proceedings (To appear) of the 2013 AASRI Conference on Intelligent Systems and Control (ISC).
  29. Soto, R., Crawford, B., Monfroy, E., and Bustos, V. (2012). Using autonomous search for generating good enumeration strategy blends in constraint programming. In Proceedings of the 12th International Conference on Computational Science and Its Applications (ICCSA), volume 7335 of LNCS, pages 607-617. Springer.
  30. Thomson, G. (1996). A Simulated Annealing Heuristic for Shift-Scheduling Using Non-Continuously Available Employees. Computers and Operations Research, 23:275-288.
  31. Warner, D. and Prawda, J. (1972). A Mathematical Programming Model for Scheduling Nursing Personnel in a Hospital. Management Science, 19(4):411-422.
Download


Paper Citation


in Harvard Style

Soto R., Crawford B., Bertrand R. and Monfroy E. (2013). Nurse Rostering with Soft Constraints - Evidence from Chilean Mid-size Health Care Centers . In Proceedings of the 15th International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 978-989-8565-59-4, pages 430-435. DOI: 10.5220/0004417404300435


in Bibtex Style

@conference{iceis13,
author={Ricardo Soto and Broderick Crawford and Rodrigo Bertrand and Eric Monfroy},
title={Nurse Rostering with Soft Constraints - Evidence from Chilean Mid-size Health Care Centers},
booktitle={Proceedings of the 15th International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2013},
pages={430-435},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004417404300435},
isbn={978-989-8565-59-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 15th International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - Nurse Rostering with Soft Constraints - Evidence from Chilean Mid-size Health Care Centers
SN - 978-989-8565-59-4
AU - Soto R.
AU - Crawford B.
AU - Bertrand R.
AU - Monfroy E.
PY - 2013
SP - 430
EP - 435
DO - 10.5220/0004417404300435