A CLASSIFICATION SCHEME FOR INTEGRATED STAFF ROSTERING AND SCHEDULING PROBLEMS

Autor(en): Paul, Mareike
Knust, Sigrid 
Stichwörter: ASSIGNMENT; classification scheme; COMPLEXITY; LOWER BOUNDS; MODELS; Operations Research & Management Science; PERSONNEL; rostering; Scheduling; staff; TASK; WORKFORCE
Erscheinungsdatum: 2015
Herausgeber: EDP SCIENCES S A
Journal: RAIRO-OPERATIONS RESEARCH
Volumen: 49
Ausgabe: 2
Startseite: 393
Seitenende: 412
Zusammenfassung: 
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.
ISSN: 03990559
DOI: 10.1051/ro/2014052

Show full item record

Page view(s)

3
Last Week
0
Last month
0
checked on Mar 2, 2024

Google ScholarTM

Check

Altmetric