A heuristic algorithm for nurse scheduling with balanced preference satisfaction
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 fairne...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
IEEE press
2011
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/32602/ |
| _version_ | 1848794446716469248 |
|---|---|
| author | Constantino, Ademir A. Landa-Silva, Dario Luiz de Melo, Everton Romao, Wesley |
| author_facet | Constantino, Ademir A. Landa-Silva, Dario Luiz de Melo, Everton Romao, Wesley |
| author_sort | Constantino, Ademir A. |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T19:16:20Z |
| format | Conference or Workshop Item |
| id | nottingham-32602 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T19:16:20Z |
| publishDate | 2011 |
| publisher | IEEE press |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-326022020-05-04T20:23:24Z https://eprints.nottingham.ac.uk/32602/ A heuristic algorithm for nurse scheduling with balanced preference satisfaction Constantino, Ademir A. Landa-Silva, Dario Luiz de Melo, Everton Romao, Wesley 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. IEEE press 2011-04 Conference or Workshop Item PeerReviewed Constantino, Ademir A., Landa-Silva, Dario, Luiz de Melo, Everton and Romao, Wesley (2011) A heuristic algorithm for nurse scheduling with balanced preference satisfaction. In: 2011 IEEE Symposium on Computational Intelligence in Scheduling (CISched 2011), 11-15 April 2011, Paris, France. Personnel scheduling nurse scheduling heuristics metaheuristics http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5976549 |
| spellingShingle | Personnel scheduling nurse scheduling heuristics metaheuristics Constantino, Ademir A. Landa-Silva, Dario Luiz de Melo, Everton Romao, Wesley A heuristic algorithm for nurse scheduling with balanced preference satisfaction |
| title | A heuristic algorithm for nurse scheduling with balanced preference satisfaction |
| title_full | A heuristic algorithm for nurse scheduling with balanced preference satisfaction |
| title_fullStr | A heuristic algorithm for nurse scheduling with balanced preference satisfaction |
| title_full_unstemmed | A heuristic algorithm for nurse scheduling with balanced preference satisfaction |
| title_short | A heuristic algorithm for nurse scheduling with balanced preference satisfaction |
| title_sort | heuristic algorithm for nurse scheduling with balanced preference satisfaction |
| topic | Personnel scheduling nurse scheduling heuristics metaheuristics |
| url | https://eprints.nottingham.ac.uk/32602/ https://eprints.nottingham.ac.uk/32602/ |