Skip to main content
SpringerLink
Log in

Solving Nurse Rostering Problems Using Soft Global Constraints

  • Conference paper
Principles and Practice of Constraint Programming - CP 2009 (CP 2009)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5732))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Meyer auf’m Hofe, H.: Solving rostering tasks as constraint optimisation. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 191–212. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Azaiez, M., Al Sharif, S.: A 0-1 goal programming model for nurse scheduling. Computers and Operations Research 32(3), 491–507 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. Brucker, P., Burke, E., Curtois, T., Qu, R., Vanden Berghe, G.: A shift sequence based approach for nurse scheduling and a new benchmark dataset. J. of Heuristics (to appear, 2009)

    Google Scholar 

  4. Burke, E., De Causmaecker, P., Vanden Berghe, G.: 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)

    Chapter  Google Scholar 

  5. Burke, E., De Causmaecker, P., Vanden Berghe, G., Van Landeghem, H.: The state of the art of nurse rostering. Journal of Scheduling 7(6), 441–499 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  6. Burke, E., Curtois, T., Qu, R., Vanden Berge, G.: A time predefined variable depth search for nurse rostering, TR 2007-6, University of Nottingham (2007)

    Google Scholar 

  7. Burke, E., Li, J., Qu, R.: A hybrid model of Integer Programming and VNS for highly-constrained nurse rostering problems. In: EJOR 2009 (to appear, 2009)

    Google Scholar 

  8. Cooper, M., de Givry, S., Sanchez, M., Schiex, T., Zytnicki, M.: Virtual arc consistency for Weighted CSP. In: AAAI 2008 (2008)

    Google Scholar 

  9. Cooper, M., Schiex, T.: Arc consistency for soft constraints. Artificial Intelligence 154(1-2), 199–227 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  10. Demassey, S., Pesant, G., Rousseau, L.-M.: A cost-regular based hybrid column generation approach. Constraints 11(4), 315–333 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  11. Ernst, A., Jiang, H., Krishnamoorthy, M., Sier, D.: Staff scheduling and rostering: A review of applications, methods and models. EJOR 153(1), 3–27 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  12. Hansen, P., Mladenovic, N., Perez-Britos, D.: Variable neighborhood decomposition search. Journal of Heuristics 7(4), 335–350 (2001)

    Article  MATH  Google Scholar 

  13. Harvey, W., Ginsberg, M.: Limited Discrepancy Search. In: IJCAI 1995, pp. 607–614 (1995)

    Google Scholar 

  14. http://www.cs.nott.ac.uk/~tec/NRP/

  15. Ikegami, A., Niwa, A.: A subproblem-centric model and approach to the nurse scheduling problem. Mathematical Programming 97(3), 517–541 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  16. Karp, R.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)

    Chapter  Google Scholar 

  17. Li, H., Lim, A., Rodrigues, B.: A hybrid AI approach for nurse rostering problem. In: SAC, pp. 730–735 (2003)

    Google Scholar 

  18. Loudni, S., Boizumault, P.: Combining VNS with constraint programming for solving anytime optimization problems. EJOR 191(3), 705–735 (2008)

    Article  MATH  Google Scholar 

  19. Menana, J., Demassey, S.: Sequencing and counting with the multicost-regular constraint. In: van Hoeve, W.J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 178–192. Springer, Heidelberg (2009)

    Google Scholar 

  20. Métivier, J.-P., Boizumault, P., Loudni, S.: Softening gcc and regular with preferences. In: SAC 2009, pp. 1392–1396 (2009)

    Google Scholar 

  21. Millar, H., Kiragu, M.: Cyclic and non-cyclic sheduling of 12h shift nurses by network programming. EJOR 104(1), 582–592 (1996)

    MATH  Google Scholar 

  22. Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers & OR 24(11), 1097–1100 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  23. Musa, A., Saxena, U.: Scheduling nurses using goal-programming techniques. IIE transactions 16, 216–221 (1984)

    Article  Google Scholar 

  24. Ozkarahan, I.: The zero-one goal programming model of a flexible nurse scheduling support system. In: Int. Industrial Engineering Conference, pp. 436–441 (1989)

    Google Scholar 

  25. Pesant, G.: A regular language membership constraint for finite sequences of variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 482–495. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  26. Petit, T., Régin, J.-C., Bessière, C.: Specific filtering algorithms for over-constrained problems. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 451–463. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  27. Qu, R., He, F.: A hybrid constraint programming approach for nurse rostering problems. In: 28th SGAI International Conference on AI, pp. 211–224 (2008)

    Google Scholar 

  28. Régin, J.-C.: Generalized arc consistency for global cardinality constraint. In: AAAI 1996, pp. 209–215 (1996)

    Google Scholar 

  29. Régin, J.-C., Gomes, C.: The cardinality matrix constraint. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 572–587. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  30. Régin, J.-C., Petit, T., Bessière, C., Puget, J.-F.: An original constraint based approach for solving over-constrained problems. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 543–548. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  31. Simonis, H.: Models for global constraint applications. Constraints 12(1), 63–92 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  32. Valouxis, C., Housos, E.: Hybrid optimization techniques for the workshift and rest assignment of nursing personnel. A.I. in Medicine 20(2), 155–175 (2000)

    Google Scholar 

  33. van Hoeve, W., Pesant, G., Rousseau, L.-M.: On global warming: Flow-based soft global constraints. Journal of Heuristics 12(4-5), 347–373 (2006)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. GREYC (CNRS - UMR 6072), Université de Caen, Campus II – Boulevard du Maréchal Juin, 14000, Caen Cedex

    Jean-Philippe Métivier, Patrice Boizumault & Samir Loudni

Authors
  1. Jean-Philippe Métivier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Patrice Boizumault
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Samir Loudni
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, University of St. Andrews, North Haugh, St Andrews, KY16 9SX, Fife, Scotland, UK

    Ian P. Gent

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Métivier, JP., Boizumault, P., Loudni, S. (2009). Solving Nurse Rostering Problems Using Soft Global Constraints. In: Gent, I.P. (eds) Principles and Practice of Constraint Programming - CP 2009. CP 2009. Lecture Notes in Computer Science, vol 5732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04244-7_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04244-7_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04243-0

  • Online ISBN: 978-3-642-04244-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation