Personnel scheduling: Models and complexity
Due to its complexity, its challenging features, and its practical relevance, personnel scheduling has been heavily investigated in the last few decades. However, there is a relatively low level of study on models and complexity in these important problems. In this paper, we present mathematical models which cover specific aspects in the personnel scheduling literature. Furthermore, we address complexity issues by identifying polynomial solvable and NP-hard special cases.
Year of publication: |
2011
|
---|---|
Authors: | Brucker, Peter ; Qu, Rong ; Burke, Edmund |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 210.2011, 3, p. 467-473
|
Publisher: |
Elsevier |
Subject: | Complexity Mathematical model Personnel scheduling |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
A shift sequence based approach for nurse scheduling and a new benchmark dataset
Brucker, Peter, (2010)
-
Personnel scheduling : models and complexity
Brucker, Peter, (2011)
-
Personnel scheduling: Models and complexity
Brucker, Peter, (2011)
- More ...