A Study on an Evaluation Model for Robust Nurse Rostering Based on Heuristics

  • Ziran Zheng
  • Xiaoju Gong
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7928)


Staff scheduling problem has been researched for decades and dozens of approaches have been proposed. Since in the hospital ward, an optimal solution could be changed for the uncertain causes, such as sick leave or other unforeseen events. If these occur, the roster that has been settled as an optimal solution often needs to make changes such as shift moves and others, some of which could have impact on the rosters fitness value. We first investigate the sensitive of an optimal solution under several operations of those types and the result shows that the solutions which are optimal obtained with the searching technique could indeed be affected by those disturbance. Secondly, the evaluation method is used to construct new evaluation function to improve the robustness of a roster. The model could apply to any method such as population-based evolutionary approaches and metaheuristics. Experiments show that it could help generate more robust solutions.


Heuristics nurse rostering robustness staff scheduling metaheuristics 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bilgin, B., Demeester, P., Misir, M., Vancroonenburg, W., Vanden Berghe, G.: One hyperheuristic approach to two timetabling problems in health care. Journal of Heuristics 18(3), 401–434 (2011)CrossRefGoogle Scholar
  2. 2.
    Burke, E.K., Kendall, G., Soubeiga, E.: A tabu-search hyperheuristic for timetabling and rostering. Journal of Heuristics 9(6), 451–470 (2003)CrossRefGoogle Scholar
  3. 3.
    Burke, E.K., Causmaecker, P.D., Petrovic, S., Berghe, G.V.: Metaheuristics for handling time interval coverage constraints in nurse scheduling. Applied Artificial Intelligence 20(9), 743–766 (2006)CrossRefGoogle Scholar
  4. 4.
    Burke, E., De Causmaecker, P., Berghe, G., Van Landeghem, H.: The state of the art of nurse rostering. Journal of Scheduling 7(6), 441–499 (2004)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Cheang, B., Li, H., Lim, A., Rodrigues, B.: Nurse rostering problemsa bibliographic survey. European Journal of Operational Research 151(3), 447–460 (2003)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Glass, C.A., Knight, R.A.: The nurse rostering problem: A critical appraisal of the problem structure. European Journal of Operational Research 202(2), 379–389 (2010)zbMATHCrossRefGoogle Scholar
  7. 7.
    He, F., Qu, R.: A constraint programming based column generation approach to nurse rostering problems. Comput. Oper. Res. 39(12), 3331–3343 (2012)CrossRefGoogle Scholar
  8. 8.
    Kawanaka, H., Yamamoto, K., Yoshikawa, T., Shinogi, T., Tsuruoka, S.: Genetic algorithm with the constraints for nurse scheduling problem. In: Proceedings of the 2001 Congress on Evolutionary Computation, vol. 2, pp. 1123–1130 (2001)Google Scholar
  9. 9.
    Hao, L.Z., Adaptive, J.K.: neighborhood search for nurse rostering. European Journal of Operational Research 218(3), 865–876 (2012)CrossRefGoogle Scholar
  10. 10.
    Maenhout, B., Vanhoucke, M.: An integrated nurse staffing and scheduling analysis for longer-term nursing staff allocation problems. Omega 41(2), 485–499 (2013)CrossRefGoogle Scholar
  11. 11.
    Ruibin, B., Burke, E.K., Kendall, G., Jingpeng, L., McCollum, B.: A hybrid evolu- tionary approach to the nurse rostering problem. IEEE Transactions on Evolutionary Computation 14(4), 580–590 (2010)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Ziran Zheng
    • 1
  • Xiaoju Gong
    • 2
  1. 1.School of Management Science and EngineeringShandong Normal UniversityJinanP.R. China
  2. 2.Provincial Hospital Affiliated to Shandong UniversityJinanP.R. China

Personalised recommendations