Skip to main content
Log in

A hybrid metaheuristic case-based reasoning system for nurse rostering

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

In this paper we present a novel Case-Based Reasoning (CBR) system called CABAROST (CAsed-BAsed ROSTering) which was developed for personnel scheduling problems. CBR is used to capture and store examples of personnel manager behaviour which are then used to solve future problems. Previous examples of constraint violations in schedules and the repairs that were used to solve the violations are stored as cases. The sequence in which violations are repaired can have a great impact on schedule quality. A novel memetic algorithm is proposed which evolves good quality sequences of repairs generated by CABAROST. The algorithm was tested on instances of the real-world nurse rostering problem at the Queens Medical Centre NHS Trust in Nottingham.

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

Similar content being viewed by others

References

  • Aickelin, U., & Dowsland, K. A. (2000). Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. Journal of Scheduling, 3(3), 139–153.

    Article  Google Scholar 

  • Aickelin, U., & Li, J. (2007). An estimation of distribution algorithm for nurse scheduling. Annals of Operations Research, 155(1), 289–309.

    Article  Google Scholar 

  • Azaiez, M. N., & Sharif, S. S. A. (2005). A 0-1 goal programming model for nurse scheduling. Computers & Operations Research, 32(3), 451–507.

    Article  Google Scholar 

  • Bailey, R. N., Garner, K. M., & Hobbs, M. F. (1997). Using simulated annealing and genetic algorithms to solve staff scheduling problems. Asia-Pacific Journal of Operational Research, 14, 27–43.

    Google Scholar 

  • Beasley, D., Bull, D., & Martin, R. (1993). An overview of genetic algorithms: Part 1, fundamentals. University Computing, 15(2), 58–69.

    Google Scholar 

  • 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, 175(2), 649–671.

    Article  Google Scholar 

  • Bester, M. J., Nieuwoudt, I., & Van Vuuren, J. H. (2007). Finding good nurse duty schedules: a case study. Journal of Scheduling, 10(6), 387–405.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Burke, E. K., Curtois, T., Post, G., Qu, R., & Veltman, B. (2008). A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. European Journal of Operational Research. doi:10.1016/j.ejor.2007.04.030.

    Google Scholar 

  • Burke, E. K., De Causmaecker, P., & Vanden Berghe, G. (1999). A hybrid tabu search algorithm for the nurse rostering problem. In B. McKay, X. Yao, C. Newton, J. Kim, & T. Furuhashi (Eds.), Lecture notes in artificial intelligence : Vol. 1585. Simulated evolution and learning (pp. 187–194). Berlin: Springer.

    Chapter  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 

  • Burke, E. K., Kendall, G., & Soubeiga, E. (2003). A tabu-search hyperheuristic for timetabling and rostering. Journal of Heuristics, 9(6), 451–470.

    Article  Google Scholar 

  • Burke, E. K., MacCarthy, B., Petrovic, S., & Qu, R. (2000). Structured cases in case-based reasoning—re-using and adapting cases for time-tabling problems. Knowledge-Based Systems, 13, 159–165.

    Article  Google Scholar 

  • Burke, E. K., Newall, J. P., & Weare, R. F. (1995). A memetic algorithm for university exam timetabling. In 1st international conference on the practice and theory of automated timetabling (ICPTAT’95), Napier University, Edinburgh, UK, 30th Aug–1st Sept. 1995 (pp. 496–503).

  • Burke, E. K., Petrovic, S., & Qu, R. (2006). Case-based heuristic selection for timetabling problems. Journal of Scheduling, 9(2), 115–132.

    Article  Google Scholar 

  • Chiaramonte, M. V., & Chiaramonte, L. M. (2008). An agent-based nurse rostering system under minimal staffing conditions. International Journal of Production Economics. doi:10.1016/j.ijpe.2008.03.004.

    Google Scholar 

  • Cunningham, P., & Smyth, B. (1997). Case-based reasoning in scheduling: reusing solution components. International Journal of Production Research, 35(11), 2947–2961.

    Article  Google Scholar 

  • Dowsland, K. (1998). Nurse scheduling with tabu search and strategic oscillation. European Journal of Operational Research, 106, 393–407.

    Article  Google Scholar 

  • Goldberg, D. (1989). Genetic algorithms in search, optimisation, and machine learning. Reading: Addison-Wesley.

    Google Scholar 

  • Holland, J. (1975). Adaption in natural and artificial systems. Cambridge: MIT Press.

    Google Scholar 

  • Kempf, K., LePape, C., Smith, C., & Fox, B. R. (1991). Issues in the design of AI-based schedulers: workshop report. Artificial Intelligence Magazine, 11, 37–46.

    Google Scholar 

  • Kolodner, J. L. (1993). Case-based reasoning. San Mateo: Morgan Kaufmann.

    Google Scholar 

  • Legato, P., & Monaco, M. F. (2004). Human resources management at a marine container terminal. European Journal of Operational Research, 156, 769–781.

    Article  Google Scholar 

  • Li, J., & Aickelin, U. (2003). A Bayesian optimization algorithm for the nurse scheduling problem. In 2003 congress on evolutionary computation (pp. 2149–2156).

  • MacCarthy, B. L., & Jou, P. (1995). A case-based expert system for scheduling problems with sequence dependent set up times. In Applications of artificial intelligence in engineering (pp. 89–96).

  • Meisels, A., & Lusternik, N. (1998). Experiments on networks of employee timetabling problems. In E. Burke & M. Carter (Eds.), Lecture notes in computer science : Vol. 1408. Practice and theory of automated timetabling: selected papers from PATAT 1997 (pp. 130–141). Berlin: Springer.

    Google Scholar 

  • Meyer auf’m Hofe, H. (2000). Solving rostering tasks as constraint optimization. In Lecture notes on computer science. Selected papers from the 3rd international conference on practice and theory of automated timetabling (PATAT) (pp. 280–297). Berlin: Springer.

    Google Scholar 

  • Michalewicz, Z., & Fogel, D. B. (2000). How to solve it: modern heuristics. Berlin: Springer.

    Google Scholar 

  • Miller, H. E., Pierskalla, W. P., & Rath, G. J. (1976). Nurse scheduling using mathematical programming. Operations Research, 24(5), 857–870.

    Article  Google Scholar 

  • Miyashita, K., & Sycara, K. (1995). CABINS: A framework of knowledge acquisition and iterative revision for schedule improvement and reactive repair. Artificial Intelligence, 76, 377–426.

    Article  Google Scholar 

  • Petrovic, S., Yang, Y., & Dror, M. (2005). Case-based initialisation for examination timetabling. In G. Kendall, E. Burke, S. Petrovic, & M. Gendreau (Eds.), Multidisciplinary scheduling: theory and applications (pp. 289–308). Berlin: Springer.

    Chapter  Google Scholar 

  • Sadeh, N., Sycara, K., & Xiong, Y. (1995). Backtracking techniques for the job shop scheduling constraint satisfaction problem. Artificial Intelligence, 76, 455–480.

    Article  Google Scholar 

  • Schmidt, G. (1998). Case-based reasoning for production scheduling. International Journal of Production Economics, 56–57, 537–546.

    Article  Google Scholar 

  • Scott, S., & Simpson, R. (1998). Case-bases incorporating scheduling constraint dimensions—experiences in nurse rostering. In Lecture notes in artificial intelligence. Advances in case-based reasoning—EWCBR98 (pp. 392–401). Berlin: Springer.

    Chapter  Google Scholar 

  • Smith, B. M., & Bennett, S. (1992). Combining constraint satisfaction and local improvement algorithms to construct anaesthetists’ rotas. In Proceedings of the conference on artificial intelligence applications (CAIA92) (pp. 106–112).

  • Smyth, B., & McKenna, E. (1998). Modelling the competence of case-bases. In Proceedings of the European workshop on case based reasoning, Dublin, Ireland (pp. 208–220). Berlin: Springer.

    Chapter  Google Scholar 

  • Sqalli, M. H., & Freuder, E. C. (1998). Integration of CSP and CBR to compensate for incompleteness and incorrectness of models. In Proceedings of the AAAI-98 spring symposium on multimodal reasoning, Stanford University.

  • Watson, I. (1999). Case-based reasoning is a methodology not a technology. Knowledge-Based Systems, 12, 303–308.

    Article  Google Scholar 

  • Watson, I., & Marir, F. (1994). Case-based reasoning: A review. The Knowledge Engineering Review, 9(2), 327–354.

    Google Scholar 

  • Wren, A. (1996). Scheduling, timetabling and rostering—a special relationship? In E. Burke & P. Ross (Eds.), Lecture notes in computer science : Vol. 1153. Practice and theory of automated timetabling (pp. 46–75). Berlin: Springer.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gareth Beddoe.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Beddoe, G., Petrovic, S. & Li, J. A hybrid metaheuristic case-based reasoning system for nurse rostering. J Sched 12, 99–119 (2009). https://doi.org/10.1007/s10951-008-0082-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-008-0082-8

Keywords

Navigation