On the complexity of Nurse Rostering problems

DSpace/Manakin Repository

On the complexity of Nurse Rostering problems
 
den Hartog, Steven J. M.; Hoogeveen, Han; van der Zanden, Tom C.
(2023) Operations Research Letters, volume 51, issue 5, pp. 483 - 487
(Article)
Abstract
In Nurse Rostering problems the goal is to assign nurses to shifts, subject to a number of constraints. In this paper we consider the computational complexity of such problems. We review the major complexity results obtained so far and show that a problem with coverage constraints, day off requests, and ... read more
Download/Full Text
The full text of this publication is not available.
 
Keywords: Complexity, NP-completeness, Nurse scheduling, Scheduling
DOI: https://doi.org/10.1016/j.orl.2023.07.004
ISSN: 0167-6377
Publisher: Elsevier
Note: Funding Information: This paper is based on the research done by Steven den Hartog when he was a master's student at Utrecht University. Publisher Copyright: © 2023 The Author(s)
(Peer reviewed)
 
See more statistics about this item