Published in

Elsevier, European Journal of Operational Research, 3(210), p. 467-473

DOI: 10.1016/j.ejor.2010.11.017

Links

Tools

Export citation

Search in Google Scholar

Personnel scheduling: Models and complexity

Journal article published in 2011 by Peter Brucker, Rong Qu ORCID, Edmund K. Burke
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Orange circle
Postprint: archiving restricted
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

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.