Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
478525 | European Journal of Operational Research | 2011 | 7 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Peter Brucker, Rong Qu, Edmund Burke,