On the complexity of Nurse Rostering problems

Steven J. M. den Hartog; Han Hoogeveen; Tom C. van der Zanden

doi:10.1016/j.orl.2023.07.004

On the complexity of Nurse Rostering problems

Steven J. M. den Hartog
, Han Hoogeveen
, Tom C. van der Zanden^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › Academic › peer-review

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 forbidden sequences of shifts of length 2 is NP-hard in the strong sense, even if there are only three work shifts and a day off shift involved. & COPY; 2023 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons .org /licenses /by /4 .0/).

Original language	English
Pages (from-to)	483-487
Number of pages	5
Journal	Operations Research Letters
Volume	51
Issue number	5
DOIs	https://doi.org/10.1016/j.orl.2023.07.004
Publication status	Published - 1 Sept 2023

Keywords

Scheduling
Complexity
NP-completeness
Nurse scheduling

Access to Document

10.1016/j.orl.2023.07.004Licence: CC BY

Cite this

@article{e992f379109d48a9be150999b277cb74,

title = "On the complexity of Nurse Rostering problems",

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 forbidden sequences of shifts of length 2 is NP-hard in the strong sense, even if there are only three work shifts and a day off shift involved. \& COPY; 2023 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons .org /licenses /by /4 .0/).",

keywords = "Scheduling, Complexity, NP-completeness, Nurse scheduling",

author = "\{den Hartog\}, \{Steven J. M.\} and Han Hoogeveen and \{van der Zanden\}, \{Tom C.\}",

note = "data source: no data used",

year = "2023",

month = sep,

day = "1",

doi = "10.1016/j.orl.2023.07.004",

language = "English",

volume = "51",

pages = "483--487",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "5",

}

TY - JOUR

T1 - On the complexity of Nurse Rostering problems

AU - den Hartog, Steven J. M.

AU - Hoogeveen, Han

AU - van der Zanden, Tom C.

N1 - data source: no data used

PY - 2023/9/1

Y1 - 2023/9/1

N2 - 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 forbidden sequences of shifts of length 2 is NP-hard in the strong sense, even if there are only three work shifts and a day off shift involved. & COPY; 2023 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons .org /licenses /by /4 .0/).

AB - 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 forbidden sequences of shifts of length 2 is NP-hard in the strong sense, even if there are only three work shifts and a day off shift involved. & COPY; 2023 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons .org /licenses /by /4 .0/).

KW - Scheduling

KW - Complexity

KW - NP-completeness

KW - Nurse scheduling

U2 - 10.1016/j.orl.2023.07.004

DO - 10.1016/j.orl.2023.07.004

M3 - Article

SN - 0167-6377

VL - 51

SP - 483

EP - 487

JO - Operations Research Letters

JF - Operations Research Letters

IS - 5

ER -

On the complexity of Nurse Rostering problems

Abstract

Keywords

Access to Document

Fingerprint

Cite this