Skip to main content
Log in

Nurse rostering at a Danish ward

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper considers a nurse rostering problem from a ward at a Danish hospital. The problem is highly constrained and comprises a large set of different constraints. A branch-and-price method for solving the problem exactly is proposed. The master problem is to assign schedules to the nurses, and its linear relaxation is solved by means of column generation. The pricing sub-problem is to generate feasible schedules for the nurses and—as a couple of different constraints including several special Danish regulations have to be observed—is solved by constraint programming. A number of specific algorithms for handling these constraints are proposed.

The method is very flexible regarding the rules a schedule should comply with, which is a key concern when creating solution methods for nurse rostering problems.

Computational tests show that optimal solutions can be found for instances with a two weeks planning period in a reasonable amount of computing time.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  • Achterberg, T., Koch, T., & Martin, A. (2005). Branching rules revisited. Operations Research Letters, 33, 42–54.

    Article  Google Scholar 

  • Bellanti, F., Carello, G., Della Croce, F., & Tadei, R. (2004). A greedy-based neighborhood search approach to a nurse rostering problem. European Journal of Operational Research, 153, 28–40.

    Article  Google Scholar 

  • Burke, E. K., De Causmaecker, P., & Vanden Berghe, G. (1999). A hybrid tabu search algorithm for the nurse rostering problem. In Proceedings of the second Asia-Pacific conference on simulated evolution and learning (pp. 187–194). Berlin: Springer.

    Google Scholar 

  • Burke, E. K., Cowling, P., De Causmaecker, P., & Vanden Berghe, G. (2001). A memetic approach to the nurse rostering problem. Applied Intelligence, 15, 199–214.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Cheang, B., Li, H., Lim, A., & Rodrigues, B. (2003). Nurse rostering problems—a bibliographic survey. European Journal of Operational Research, 151, 447–460.

    Article  Google Scholar 

  • Demassey, S., Pesant, G., & Rousseau, L. M. (2005). Constraint programming based column generation for employee timetabling. In R. Barták & M. Milano (Eds.), Lecture notes in computer science: Vol. 3524. Integration of AI and OR techniques in constraint programming for combinatorial optimization problems (pp. 830–833). Berlin: Springer.

    Chapter  Google Scholar 

  • Dowsland, K. A., & Thompson, J. M. (2000). Solving a nurse scheduling problem with knapsacks, networks and tabu search. Journal of the Operational Research Society, 51(7), 825–833.

    Article  Google Scholar 

  • Goodman, M. D., Dowsland, K. A., & Thompson, J. M. (2009). A grasp-knapsack hybrid for a nurse-scheduling problem. Journal of Heuristics, 15(4), 351–379.

    Article  Google Scholar 

  • Meyer auf’m Hofe, H. (2001). Solving rostering tasks as constraint optimization. In Practice and theory of automated timetabling III (Vol. 2079, pp. 191–212).

    Chapter  Google Scholar 

  • Jaumard, B., Semet, F., & Vovor, T. (1998). A generalized linear programming model for nurse scheduling. European Journal of Operational Research, 107, 1–18.

    Article  Google Scholar 

  • Li, H., Lim, A., & Rodrigues, B. (2003). A hybrid AI approach for nurse rostering problem. In Proceedings of the 2003 ACM symposium on applied computing, SAC’03 (pp. 730–735). New York: ACM.

    Chapter  Google Scholar 

  • Meisels, A., Gudes, E., & Solotorevsky, G. (1996). Employee timetabling, constraint networks and knowledge-based rules: a mixed approach. In E. K. Burke & P. Ross (Eds.), Lecture notes in computer science: Vol. 1153. Practice and theory of automated timetabling (pp. 91–105). Berlin: Springer.

    Chapter  Google Scholar 

  • Okada, M. (1992). An approach to the generalized nurse scheduling problem-generation of a declarative program to represent institution-specific knowledge. Computers and Biomedical Research, 25(5), 417–434.

    Article  Google Scholar 

  • Warner, D. M. (1976). Scheduling nursing personnel according to nursing preference: a mathematical programming approach. Operations Research, 24(5), 842–856.

    Article  Google Scholar 

  • Wong, G. Y. C., & Chun, A. H. W. (2004). Constraint-based rostering using meta-level reasoning and probability-based ordering. Engineering Applications of Artificial Intelligence, 17(6), 599–610.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jonas Baeklund.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baeklund, J. Nurse rostering at a Danish ward. Ann Oper Res 222, 107–123 (2014). https://doi.org/10.1007/s10479-013-1511-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-013-1511-4

Keywords

Navigation