id: 05905036
dt: j
an: 05905036
au: Brucker, Peter; Qu, Rong; Burke, Edmund
ti: Personnel scheduling: models and complexity.
so: Eur. J. Oper. Res. 210, No. 3, 467-473 (2011).
py: 2011
pu: Elsevier Science B.V.(North-Holland), Amsterdam
la: EN
cc: 
ut: complexity; mathematical model; personnel scheduling
ci: 
li: doi:10.1016/j.ejor.2010.11.017
ab: Summary: 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.
rv: