Personnel scheduling: Models and complexity

Autor(en): Brucker, Peter
Qu, Rong
Burke, Edmund
Stichwörter: ALGORITHMS; Business & Economics; Complexity; Management; Mathematical model; OF-THE-ART; Operations Research & Management Science; Personnel scheduling; STAFF
Erscheinungsdatum: 2011
Herausgeber: ELSEVIER SCIENCE BV
Journal: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volumen: 210
Ausgabe: 3
Startseite: 467
Seitenende: 473
Zusammenfassung: 
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. Crown Copyright (C) 2010 Published by Elsevier B.V. All rights reserved.
ISSN: 03772217
DOI: 10.1016/j.ejor.2010.11.017

Show full item record

Page view(s)

4
Last Week
0
Last month
1
checked on Feb 26, 2024

Google ScholarTM

Check

Altmetric