Sciweavers

EOR
2011

Personnel scheduling: Models and complexity

13 years 2 months ago
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.
Peter Brucker, Rong Qu, Edmund K. Burke
Added 27 Aug 2011
Updated 27 Aug 2011
Type Journal
Year 2011
Where EOR
Authors Peter Brucker, Rong Qu, Edmund K. Burke
Comments (0)