| Issue |
RAIRO-Oper. Res.
Volume 49, Number 2, April-May 2015
New challenges in scheduling theory
|
|
|---|---|---|
| Page(s) | 393 - 412 | |
| DOI | https://doi.org/10.1051/ro/2014052 | |
| Published online | 19 January 2015 | |
A classification scheme for integrated staff rostering and scheduling problems
Institute of Computer Science, University of Osnabrück, 49069 Osnabrück,
Germany.
mareike.paul@uni-osnabrueck.de;sigrid.knust@uni-osnabrueck.de
Received:
9
February
2013
Accepted:
26
September
2014
In the last decades job scheduling, staff rostering and staff assignment have received considerable attention, as have combinations of these problems. However, given the wide range of variants of all three basic problems, the number of combinations is immense. In this paper we introduce a new classification scheme for integrated staff rostering and job scheduling problems, extending existing schemes for project and machine scheduling. We provide some elementary reductions and show how problems studied in the literature fit into this new classification scheme. Furthermore, some complexity results are presented.
Mathematics Subject Classification: 90B35 / 68Q25
Key words: Scheduling / rostering / assignment / staff / classification scheme / complexity
© EDP Sciences, ROADEF, SMAI 2015
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.