Solution approaches to large shift scheduling problems
DOI10.1051/RO:2008006zbMATH Open1154.90483OpenAlexW2168973665MaRDI QIDQ3539809FDOQ3539809
Authors: Monia Rekik, Jean-François Cordeau, François Soumis 
Publication date: 19 November 2008
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=RO_2008__42_2_229_0/
Recommendations
- scientific article; zbMATH DE number 1462943
- A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows
- Optimal Shift Scheduling with Multiple Break Windows
- Solving Large-Scale Tour Scheduling Problems
- A comparative evaluation of modeling approaches to the labor shift scheduling problem
heuristicflexibilityshift schedulinglocal branchingforward and backward constraintswork stretch restrictionsfractionable breaks
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)
Cites Work
- Local branching
- Variable neighborhood search
- Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Bechtold-Jacobs generalized model for shift scheduling with extraordinary overlap
- Optimal Shift Scheduling with Multiple Break Windows
- Using Benders decomposition to implicitly model tour scheduling
- A comparative evaluation of modeling approaches to the labor shift scheduling problem
- A simulated-annealing heuristic for shift scheduling using non-continuously available employees
- A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows
- Improved Implicit Optimal Modeling of the Labor Shift Scheduling Problem
- Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
- Starting-time decisions in labor tour scheduling: An experimental analysis and case study
- Reformulating linear programs with transportation constraints-With applications to workforce scheduling
Cited In (9)
- A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows
- A mixed integer programming approach to multi-skilled workforce scheduling
- An assessment of a days off decomposition approach to personnel shift scheduling
- An implicit model for multi-activity shift scheduling problems
- A stochastic optimization approach to shift scheduling with breaks adjustments
- Implicit shift scheduling with multiple breaks and work stretch duration restrictions
- A large neighbourhood search approach to the multi-activity shift scheduling problem
- Accelerating Benders method using covering cut bundle generation
- Shift rostering using decomposition: assign weekend shifts first
This page was built for publication: Solution approaches to large shift scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3539809)
