Abstract
On nurse shift schedules, it is common that the nursing staff have diverse preferences about shift rotations and days off. We propose a nurse scheduling model based upon integer programming under the constraints of the schedule, different preference ranks towards each shift and the historical data of previous schedule periods so that the nursing staff’s preference satisfaction about the shift schedule is maximized. The main difference of the proposed model from the previous works is to consider that the nursing staff’s satisfaction level is affected by preference ranks and their priority ordering to be scheduled, so that the quality of shift schedule is more reasonable.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Aickelin U, Dowsland KA (2004) An indirect genetic algorithm for a nurse-scheduling problem. Comput Oper Res 31(5):761–778
Clark PA, Leddy K, Drain M, Kaldenberg D (2007) State nursing shortages and patient satisfaction: more RNs–better patient experiences. J Nurs Care Qual 22(2):119–127
Felici G, Gentile C (2004) A polyhedral approach for the staff rostering problem. Manage Sci 50(3):381–393
Hadwan M, Ayob M, Sabar NR, Qu R (2013) A harmony search algorithm for nurse rostering problems. Inf Sci 233(6):126–140
M’Hallah R, Sharif AA (2013) Scheduling of nurses: a case study of a Kuwaiti health care unit. Oper Res Health Care 2(1–2):1–19
Maenhout B, Vanhoucke M (2013) An integrated nurse staffing and scheduling analysis for loner-term nursing staff allocation problems. Omega 40(2):485–499
Topaloglu S, Selim H (2010) Nurse scheduling using fuzzy modeling approach. Fuzzy Sets Syst 161(11):1543–1563
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Lin, CC., Kang, JR., Liu, WY. (2015). A Mathematical Model for Nurse Scheduling with Different Preference Ranks. In: Park, J., Pan, Y., Kim, C., Yang, Y. (eds) Future Information Technology - II. Lecture Notes in Electrical Engineering, vol 329. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-9558-6_2
Download citation
DOI: https://doi.org/10.1007/978-94-017-9558-6_2
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-017-9557-9
Online ISBN: 978-94-017-9558-6
eBook Packages: EngineeringEngineering (R0)