A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering
E. Veen (),
J. L. Hurink,
J. M. J. Schutten and
S. T. Uijland
Additional contact information
E. Veen: ORTEC
J. L. Hurink: University of Twente
J. M. J. Schutten: University of Twente
S. T. Uijland: ORTEC
Annals of Operations Research, 2016, vol. 239, issue 1, No 11, 189-206
Abstract:
Abstract Self-rostering is receiving more and more attention in literature and in practice. With self-rostering, employees propose the schedule they prefer to work during a given planning horizon. However, these schedules often do not match with the staffing demand as specified by the organization. We present an approach to support creating feasible schedules that uses the schedules proposed by the employees as input and that aims to divide the burden of shift reassignments fairly throughout the employees. We discuss computational results and indicate how various model parameters influence scheduling performance indicators. The presented approach is flexible and easily extendable, since labor rule checks are isolated from the actual algorithm, which makes it easy to include additional labor rules in the approach. Moreover, our approach enables the user to make a trade-off between the quality of the resulting roster and the extent to which the planner is able to track the decisions of the algorithm.
Keywords: Self-rostering; Linear programming; Heuristics; Personnel rostering; Shift rostering (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://link.springer.com/10.1007/s10479-014-1540-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:239:y:2016:i:1:d:10.1007_s10479-014-1540-7
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479
DOI: 10.1007/s10479-014-1540-7
Access Statistics for this article
Annals of Operations Research is currently edited by Endre Boros
More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().