Shift rostering using decomposition: assign weekend shifts first


Veen, Egbert van der and Hans, Erwin W. and Post, Gerhard and Veltman, Bart (2012) Shift rostering using decomposition: assign weekend shifts first. [Report]

open access
Abstract:This paper introduces a shift rostering problem that surprisingly has not been studied in literature: the weekend shift rostering problem. It is motivated by our experience that employees’ shift preferences predominantly focus on the weekends, since many social activities happen during weekends. The Weekend Rostering Problem (WRP) addresses the rostering of weekend shifts, for which we design a problem specific heuristic. We consider the WRP as the first phase of the shift rostering problem. To complete the shift roster, the second phase assigns the weekday shifts using an existing algorithm. We discuss effects of this two-phase approach both on the weekend shift roster and on the roster as a whole. We demonstrate that our first-phase heuristic is effective both on generated instances and real-life instances. For situations where the weekend shift roster is one of the key determinants of the quality of the complete roster, our two-phase approach shows to be effective when incorporated in a commercially implemented algorithm.
Item Type:Report
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Faculty of Behavioural, Management and Social sciences (BMS)
Research Chair:
Research Group:
Link to this item:
Publisher URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 285080