Volume 42, Number 2, April-June 2008CIRO 05
|Page(s)||229 - 258|
|Published online||17 May 2008|
Solution approaches to large shift scheduling problems
École Polytechnique de Montréal and GERAD,
C.P. 6079, succ. Centre-Ville Montréal, H3C 3A7, Canada
2 HEC Montréal and GERAD, 3000, chemin de la Côte-Sainte-Catherine, Montréal H3T 2A7, Canada; email@example.com
Accepted: 28 November 2007
This paper considers large shift scheduling problems with different shift start times and lengths, fractionable breaks and work stretch duration restrictions. Two solution approaches are proposed to solve the problems over a multiple-day planning horizon. The first approach is based on a local branching strategy and the second one is based on a temporal decomposition of the problem. Local branching is very efficient in finding good feasible solutions when compared to a classical branch-and-bound procedure. However, the decomposition approach has the advantage of yielding feasible solutions in short computing times, even for difficult instances.
Mathematics Subject Classification: 90C10 / 90C11 / 90C29
Key words: Shift scheduling / flexibility / fractionable breaks / work stretch restrictions / forward and backward constraints / local branching / heuristic.
© EDP Sciences, ROADEF, SMAI, 2008
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.