Abstract
Self-rostering is receiving more and more attention in literature and in practice. With self-rostering, employees propose the schedule they prefer to work during a given planning horizon. However, these schedules often do not match with the staffing demand as specified by the organization. We present an approach to support creating feasible schedules that uses the schedules proposed by the employees as input and that aims to divide the burden of shift reassignments fairly throughout the employees. We discuss computational results and indicate how various model parameters influence scheduling performance indicators. The presented approach is flexible and easily extendable, since labor rule checks are isolated from the actual algorithm, which makes it easy to include additional labor rules in the approach. Moreover, our approach enables the user to make a trade-off between the quality of the resulting roster and the extent to which the planner is able to track the decisions of the algorithm.
Similar content being viewed by others
References
Ásgeirsson, E. (2012). Bridging the gap between self schedules and feasible schedules in staff scheduling. Annals of Operations Research (to appear). doi:10.1007/s10479-012-1060-2
Bailyn, L., Collins, R., & Song, Y. (2007). Self-scheduling for hospital nurses: An attempt and its difficulties. Journal of Nursing Management, 15(1), 72–77.
Bard, J. F., & Purnomo, H. W. (2005). Preference scheduling for nurses using column generation. European Journal of Operational Research, 164(2), 510–534.
Brooks, I., & Swailes, S. (2002). Analysis of the relationship between nurse influences over flexible working and commitment to nursing. Journal of Advanced Nursing, 38(2), 117–126.
Burke, E., 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.
Clark, A. R., & Walker, H. (2011). Nurse rescheduling with shift preferences and minimal disruption. Journal of Applied Operational Research, 3(3), 148–162.
De Grano, M. L., Medeiros, D., & Eitel, D. (2009). Accommodating individual preferences in nurse scheduling via auctions and optimization. Health Care Management Science, 12(3), 228–242.
Ernst, A., Jiang, H., Krishnamoorthy, M., Owens, B., & Sier, D. (2004). An annotated bibliography of personnel scheduling and rostering. Annals of Operations Research, 127(1), 21–144.
Hung, R. (1992). Improving productivity and quality through workforce scheduling. Industrial Management, 34(6), 4.
Kellogg, D., & Walczak, S. (2007). Nurse scheduling: From academia to implementation or not? Interfaces, 37(4), 355–369.
Maenhout, B., & Vanhoucke, M. (2011). An evolutionary approach for the nurse rerostering problem. Computers & Operations Research, 38(10), 1400–1411.
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(1), 179–197.
Moz, M., & Pato, M. V. (2007). A genetic algorithm approach to a nurse rerostering problem. Computers & Operations Research, 34(3), 667–691.
Petrovic, S., Beddoe, G., & Vanden Berghe, G. (2003). Storing and adapting repair experiences in employee rostering. In E Burke & P Causmaecker (Eds.), Practice and theory of automated timetabling IV lecture notes in computer science, vol 2740 (pp. 148–165). Berlin: Springer.
Purnomo, H. W., & Bard, J. F. (2007). Cyclic preference scheduling for nurses using branch and price. Naval Research Logistics (NRL), 54(2), 200–220.
Robb, E. A., Determan, A. C., Lampat, L. R., Scherbring, M. J., Slifka, R. M., & Smith, N. A. (2003). Strategies at work: Self-scheduling: Satisfaction guaranteed?. Nursing Management, 34(7), 16–18.
Rönnberg, E., & Larsson, T. (2010). Automating the self-scheduling process of nurses in swedish healthcare: A pilot study. Health Care Management Science, 13(1), 35–53.
Self-Rostering Instances. (2013). Retrieved September, 2013 from http://www.utwente.nl/mb/iebis/staff/schutten/SelfRostering/Instances.zip.
Teahan, B. (1998). Implementation of a self-scheduling system: A solution to more than just schedules. Journal of Nursing Management 6, (6):361–368
Uijland, S. (2012). Creating feasible schedules in the last step of the self rostering process. http://essay.utwente.nl/62123/. Accessed Feb 2014.
Vanden Bergh, J., Beliën, J., De Bruecker, P., Demeulemeester, E., & De Boeck, Z. L. (2013). Personnel scheduling: A literature review. European Journal of Operational Research, 226(3), 367–385.
Wang Z., & Wang C. (2009). Automating nurse self-rostering: A multiagent systems model. In IEEE international conference on systems, man and cybernetics, (pp. 4422–4425)
Acknowledgements
This research is supported by the Dutch Technology Foundation STW, applied science division of NWO and the Technology Program of the Ministry of Economic Affairs. The authors thank the anonymous referees for their valuable comments that have helped to improve the paper.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
van der Veen, E., Hurink, J.L., Schutten, J.M.J. et al. A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering. Ann Oper Res 239, 189–206 (2016). https://doi.org/10.1007/s10479-014-1540-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-014-1540-7