This paper considers large shift scheduling problems with different shiftstart times and lengths, fractionable breaks and work stretch durationrestrictions. Two solution approaches are proposed to solve the problemsover a multiple-day planning horizon. The first approach is based on alocal branching strategy and the second one is based on a temporaldecomposition of the problem. Local branching is veryefficient in finding good feasible solutions when compared to a classicalbranch-and-bound procedure. However, the decomposition approach has theadvantage of yielding feasible solutions in short computing times, even for difficult instances.
