Abstract
Despite decades of research into automated methods for nurse rostering and some academic successes, one may notice that there is no consistency in the knowledge that has been built up over the years and that many healthcare institutions still resort to manual practices. One of the possible reasons for this gap between the nurse rostering theory and practice is that often the academic community focuses on the development of new techniques rather than developing systems for healthcare institutions. In addition, methods suitable for one problem are usually not easily transferable to other problems. In real-world healthcare environments, a personnel manager cannot afford to model a problem and construct a roster using available approaches in order to quantitatively determine which one suits best. There is a lack of criteria for the comparison of approaches to provide a clear picture about their advantages and disadvantages and therefore their suitability to a problem in hand. This paper introduces seven criteria: expressive power, flexibility, algorithmic power, learning capabilities, maintenance, rescheduling capabilities, and parameter tuning, that may offer guidance to researchers and developers of systems for nurse rostering. Two approaches to nurse rostering, which are of very different nature, are evaluated and compared against the introduced criteria. One approach is based on meta-heuristics, while the other employs case-based reasoning.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aickelin, U., & White, P. (2004). Building better nurse scheduling algorithms. Annals of Operations Research, 128, 159–177.
Azaiez, M. N., & Al-Sharif, S. S. (2005). A 0-1 goal programming model for nurse scheduling. Computers and Operations Research, 32(3), 507–491.
Bard, J. F., & Purnomo, H. W. (2005). Preference scheduling for nurses using column generation. European Journal of Operational Research, 164, 510–534.
Bard, J. F., & Purnomo, H. W. (2007). Cyclic preference scheduling of nurses using a Lagrangian-based heuristic. Journal of Scheduling, 10(1), 5–23.
Beddoe, G. (2005). Case-based reasoning in personnel rostering. PhD thesis, University of Nottingham.
Beddoe, G., & Petrovic, S. (2006). Selecting and weighting features using a genetic algorithm in a case-based reasoning approach to personnel rostering. European Journal of Operational Research (EJOR), 175(2), 649–671.
Beddoe, G., & Petrovic, S. (2007). Enhancing case-based reasoning for personnel rostering with selected tabu search concepts. Journal of the Operational Research Society (JORS), 58(12), 1586–1598.
Beddoe, G., Petrovic, S., & Li, J. (2009). Hybrid metaheuristic case-based reasoning system for nurse rostering. Journal of Scheduling, 12(2), 99–119.
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(1), 28–40.
Bilgin, B., De Causmaecker, P., Rossie, B., & Vanden Berghe, G. (2010). Local search neighbourhoods for dealing with a novel nurse rostering model. Annals of Operations Research—Patat Special. doi:10.1007/s10479-010-0804-0.
Burke, E. K., Cowling, P., De Causmaecker, P., & Vanden Berghe, G. (2001a). A memetic approach to the nurse rostering problem. Applied Intelligence, 15(3), 199–214.
Burke, E. K., De Causmaecker, P., Petrovic, S., & Vanden Berghe, G. (2001b). Fitness evaluation for nurse scheduling problems. In Proceedings of congress on evolutionary computation, CEC2001 (pp. 1139–1146). Seoul. New York: IEEE Press.
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.
Burke, E. K., De Causmaecker, P., Petrovic, S., & Vanden Berghe, G. (2006). Metaheuristics for handling time interval coverage constraints in nurse scheduling. Applied Artificial Intelligence, 20(9), 743–766.
Burke, E. K., Curtois, T., Qu, R., & Vanden Berghe, G. (2007). A time pre-defined variable depth search for nurse rostering (Technical report). University of Nottingham.
Cavalieri, S., Terzi, S., & Macchi, M. (2007). A benchmarking service for the evaluation and comparison of scheduling techniques. Computers in Industry, 58, 656–666.
De Causmaecker, P., & Vanden Berghe, G. (2003). Relaxation of coverage constraints in hospital personnel rostering. In E. K. Burke & P. De Causmaecker (Eds.), LNCS: Vol. 2740. PATAT 2002 (pp. 129–147). Berlin: Springer.
de la Asunción, M., Castillo, L., Fernández-Olivares, J., García-Pérez, O., González, A., & Palao, F. (2007). Handling fuzzy temporal constraints in a planning environment. Annals of Operations Research, 155(1), 391–415.
Gendreau, M., Ferland, J., Gendron, B., Hail, N., Jaumard, B., Lapierre, S., Pesant, G., & Soriano, P. (2007). Physician scheduling in emergency rooms. In E. K. Burke & H. Rudová (Eds.), LNCS: Vol. 3867. PATAT 2006 (pp. 53–66). Berlin: Springer.
Gutjahr, W. J., & Rauner, M. S. (2007). An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria. Computers & Operations Research, 34(3), 642–666.
Isken, M. (2004). An implicit tour scheduling model with applications in healthcare. Annals of Operations Research, 128, 91–109.
Kaplansky, E., & Meisels, A. (2007). Distributed personnel scheduling—negotiation among scheduling agents. Annals of Operations Research, 155(1), 227–255.
Kellogg, D. L., & Walczak, S. (2007). Nurse scheduling: From academia to implementation or not? Interfaces, 37(4), 355–369.
Kolodner, J. (1993). Case-based reasoning. San Mateo: Morgan-Kaufmann.
Leake, D. (Ed.) (1996). Case-based reasoning, experiences, lessons & future directions. Menlo Park: AAAI Press.
Le Pape, C. (1993). Classification of scheduling problems and selection of corresponding constraint-based techniques. In Proceedings of the IEE colloquium on advanced software technologies for scheduling, London, UK (pp. 1.1–1.3).
Luger, G. E., & Stubblefield, W. A. (1998). Artificial intelligence, structures and strategies for complex problem solving (3rd ed.). Reading: Addison-Wesley Longman.
Maenhout, B., & Vanhoucke, M. (2006). New computational results for the nurse scheduling problem: a scatter search algorithm. In J. Gottlieb & G. R. Raidl (Eds.), LNCS: Vol. 3906. EvoCOP (pp. 159–170). Berlin: Springer.
Maenhout, B., & Vanhoucke, M. (2007). An electromagnetism meta-heuristic for the nurse scheduling problem. Journal of Heuristics, 13(4), 359–385.
Meyer auf’m Hofe, H. (2001). Solving rostering tasks as constraint optimization. In E. Burke & W. Erben (Eds.), LNCS: Vol. 2079. Practice and theory of automated timetabling III (pp. 191–212). Berlin: Springer.
Moz, M., & Pato, M. V. (2004). Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models. Annals of Operations Research, 128, 179–197.
Parr, D., & Thompson, J. M. (2007). Solving the multi-objective nurse scheduling problem with a weighted cost function. Annals of Operations Research, 155(1), 279–288.
Petrovic, S., Beddoe, G., & Vanden Berghe, G. (2003). Storing and adapting repair experiences in personnel rostering. In E. K. Burke & P. De Causmaecker (Eds.), LNCS: Vol. 2740. Practice and theory of automated timetabling IV (pp. 149–166). Berlin: Springer.
Santamaria, J. C., & Ram, A. (1996). Systematic evaluation of design decisions in case-based reasoning systems. In D. Leake (Ed.), Case-based reasoning, experiences, lessons & future directions (pp. 199–233). Menlo Park: AAAI Press.
Turban, E., Aronson, J., Liang, T.-P., & Sharda, R. (2007). Decision support systems and business intelligence systems (8th ed). New York: Prentice Hall.
Vanden Berghe, G. (2002). An advanced model and novel meta-heuristic solution methods to personnel scheduling in healthcare. PhD thesis, University of Gent.
White, C., Nano, E., Nguyen-Ngoc, D.-H., & White, G. (2007). An evaluation of certain heuristic optimization algorithms in scheduling medical doctors and medical students. In E. K. Burke & H. Rudová (Eds.), LNCS: Vol. 3867. Practice and theory of automated timetabling IV (pp. 105–115). Berlin: Springer.
Wren, A. (1996). Scheduling, timetabling and rostering—a special relationship? In E. Burke & P. Ross (Eds.), LNCS (Vol. 1153, pp. 46–75). Berlin: Springer.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Petrovic, S., Vanden Berghe, G. A comparison of two approaches to nurse rostering problems. Ann Oper Res 194, 365–384 (2012). https://doi.org/10.1007/s10479-010-0808-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-010-0808-9