A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows
From MaRDI portal
Publication:3157711
DOI10.1057/palgrave.jors.2600472zbMath1131.90348OpenAlexW2064678792MaRDI QIDQ3157711
Publication date: 19 January 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600472
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (8)
A Benders decomposition-based matheuristic for the cardinality constrained shift design problem ⋮ Formal languages for integer programming modeling of shift scheduling problems ⋮ Solution approaches to large shift scheduling problems ⋮ Bechtold-Jacobs generalized model for shift scheduling with extraordinary overlap ⋮ Implicit shift scheduling with multiple breaks and work stretch duration restrictions ⋮ A large neighbourhood search approach to the multi-activity shift scheduling problem ⋮ Combining integer programming and the randomization method to schedule employees ⋮ A comparative evaluation of modeling approaches to the labor shift scheduling problem
This page was built for publication: A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows
