A Fairness-Based Heuristic Technique for Long-Term Nurse Scheduling
Samah Senbel ()
Additional contact information
Samah Senbel: School of Computer Science and Engineering, Sacred Heart University, Fairfield, CT, USA
Asia-Pacific Journal of Operational Research (APJOR), 2021, vol. 38, issue 02, 1-37
Abstract:
We present a new heuristic long-term solution to the Nurse Scheduling Problem (NSP). Nurse scheduling requires the satisfaction of a set of constraints: Hard constraints that must be satisfied, and soft constraints that are specified by the nurses according to their preferences. The quality of a technique is measured by the level of satisfaction of those constraints, which we measure using a penalty system. We propose a three-phase solution based on the way nurses trade shifts: In the first phase, we generate a schedule that satisfies all the hard constraints irrespective of the individual nurses. Then, each nurse is matched to her optimal schedule. Finally, we satisfy as many of the soft constraints as possible using shift swapping between the different nurses’ schedules. We analyze the performance of our technique and it obtained satisfactory results in reasonable time compared to a brute-force generated optimal schedule that takes an extremely long time to generate. We extended the scheduling technique to multiple scheduling periods by carrying the old penalties accumulated by a nurse to her new schedule. This guarantees fairness over the long term, and decreased the variance in overall penalties by over 50% compared to independently scheduling each schedule period.
Keywords: Scheduling; hospital administration; heuristic scheduling; optimization problem; nurse scheduling problem (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:
Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595920500475
Access to full text is restricted to subscribers
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:wsi:apjorx:v:38:y:2021:i:02:n:s0217595920500475
Ordering information: This journal article can be ordered from
DOI: 10.1142/S0217595920500475
Access Statistics for this article
Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao
More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().