Abstract
Solving the Nurse Scheduling problem is a major research area in Operations Research. Due to it being an NP-Hard problem, most researchers develop a heuristic solution for it. The NSP has several constraints that need to be satisfied: several mandatory “hard” constraints that reflect hospital requirements, and several optional “soft” constraints that reflect the nurses’ preferences. In this paper, we present a recursive solution to the problem that makes use of those constraints to shrink the search space and obtain results in a reasonable amount of time. We present two variations of the solution, a nurse-by-nurse method of building the optimal schedule, and a shift-by-shift approach. Both variations were implemented and tested with various scenarios and the shift-by-shift solution provided much better results. The solution can also be modified easily to provide fair long-term scheduling.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Lu, K., Lin, P., Wu, C., Hsieh, Y.: The relationships amongst turnover intentions, professional commitment and job satisfaction of hospital nurses. J. Professional Nursing 18(4), 214–219 (2002)
Warner, D.: Scheduling nurse personnel according to nursing preference: a mathematical programming approach. Oper. Res. 24, 842–856 (1976)
Burke, E., De Causmaecker, P., Vanden Berghe, G., Van Landeghem, H.: The state of the art of nurse rostering. J. Sched. 7, 441–499 (2004)
Bai, R., Burke, E.K., Kendall, G., Li, J., McCollum, B.: A hybrid evolutionary approach to the nurse rostering problem. Trans. Evolutionary Computing 14, 580–590 (2010)
Oughalime, A., Ismail, W.R., Yeun, L.C.: A Tabu search approach to the nurse scheduling problem. In: Proceeding of the International Symposium on Information Technology, Kuala Lumpur, Malaysia, pp. 1–7 (2008)
Kundu, S., Mahato, M., Mahanty, B., Acharyya, S.: Comparative performance of simulated annealing and genetic algorithm in solving nurse scheduling problem. In: Proceeding of the International Multi Conference on Engineers and Computer Sciences, pp. 19–21 (2008)
Lü, Z., Hao, J.-K.: Adaptive neighborhood search for nurse rostering. Eur. J. Oper. Res. 218, 865–876 (2012)
Youssef, A., Senbel, S.: A bi-level heuristic solution for the nurse scheduling problem based on shift-swapping, IEEE 8th Annual Computing and Communication Workshop and Conference (2018)
Gunther, M., Nissen, V.: Particle swarm optimization and the agent-based algorithm for a problem of staff scheduling. Lect. Notes Comput. Sci. 6025, 451–461 (2010)
Gutjahr, W.J., Rauner, M.S.: An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria. Comput. Oper. Res. 34, 642–666 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Senbel, S. (2019). Novel Recursive Technique for Finding the Optimal Solution of the Nurse Scheduling Problem. In: Arai, K., Bhatia, R., Kapoor, S. (eds) Intelligent Computing. CompCom 2019. Advances in Intelligent Systems and Computing, vol 997. Springer, Cham. https://doi.org/10.1007/978-3-030-22871-2_25
Download citation
DOI: https://doi.org/10.1007/978-3-030-22871-2_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-22870-5
Online ISBN: 978-3-030-22871-2
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)