A heuristic algorithm for nurse scheduling with balanced preference satisfaction

Constantino, Ademir A.; Landa-Silva, Dario; Luiz de Melo, Everton; Romao, Wesley

Abstract

This paper tackles the nurse scheduling problem with balanced preference satisfaction which consists of generating an assignment of shifts to nurses over a given time horizon and ensuring that the satisfaction of nurses personal preferences for shifts is as even as possible in order to ensure fairness. We propose a heuristic algorithm based on successive resolutions of the bottleneck assignment problem. The algorithm has two phases. In the first phase, the algorithm constructs an initial solution by solving successive bottleneck assignment problems. In the second phase, two improvement procedures based on reassignment steps are applied. Computational tests are carried out using instances from the standard benchmark dataset NSPLib. Our experiments indicate that the proposed method is effective and efficient, reducing discrepancies (hence improving fairness) between the individual rosters.

Citation

Constantino, A. A., Landa-Silva, D., Luiz de Melo, E., & Romao, W. (2011). A heuristic algorithm for nurse scheduling with balanced preference satisfaction.

• Conference Name: 2011 IEEE Symposium on Computational Intelligence in Scheduling (CISched 2011)
• End Date: Apr 15, 2011
• Publication Date: Apr 1, 2011
• Deposit Date: Apr 4, 2016
• Publicly Available Date: Apr 4, 2016
• Peer Reviewed: Peer Reviewed
• Keywords: Personnel scheduling, nurse scheduling, heuristics metaheuristics
• Public URL: https://nottingham-repository.worktribe.com/output/1010094
• Publisher URL: http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5976549
• Additional Information: Published in: 2011 IEEE Symposium on Computational Intelligence in Scheduling (SCIS), 11-15 April 2011, Paris, France. Piscataway : IEEE, 2011. ISBN 9781612841953, doi: 10.1109/SCIS.2011.5976549