Please use this identifier to cite or link to this item:
Appears in Collections:Computing Science and Mathematics Journal Articles
Peer Review Status: Refereed
Title: Personnel scheduling: Models and complexity
Author(s): Brucker, Peter
Qu, Rong
Burke, Edmund
Contact Email:
Keywords: Complexity
Mathematical model
Personnel scheduling
Issue Date: 1-May-2011
Citation: Brucker P, Qu R & Burke E (2011) Personnel scheduling: Models and complexity, European Journal of Operational Research, 210 (3), pp. 467-473.
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.
DOI Link:
Rights: The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.

Files in This Item:
File Description SizeFormat 
Personnel scheduling.pdf264.81 kBAdobe PDFUnder Permanent Embargo    Request a copy

Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependent on the depositor still being contactable at their original email address.

This item is protected by original copyright

Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

If you believe that any material held in STORRE infringes copyright, please contact providing details and we will remove the Work from public display in STORRE and investigate your claim.