A Benders decomposition-based matheuristic for the cardinality constrained shift design problem
From MaRDI portal
Publication:323346
DOI10.1016/j.ejor.2016.04.014zbMath1346.90368OpenAlexW1171506936WikidataQ114184466 ScholiaQ114184466MaRDI QIDQ323346
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://orbit.dtu.dk/en/publications/5898040b-5c04-4788-9c3d-52734f13b43c
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduler -- a system for staff planning
- Using Benders decomposition to implicitly model tour scheduling
- Partitioning procedures for solving mixed-variables programming problems
- Staff scheduling and rostering: a review of applications, methods and models.
- Local search for shift design.
- A comparative evaluation of modeling approaches to the labor shift scheduling problem
- An annotated bibliography of personnel scheduling and rostering
- A simulated-annealing heuristic for shift scheduling using non-continuously available employees
- Personnel scheduling: a literature review
- Interior point stabilization for column generation
- The minimum shift design problem
- Generalized Benders decomposition
- Integrated Simulation, Heuristic and Optimisation Approaches to Staff Scheduling
- A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Optimal Shift Scheduling with Multiple Break Windows
- Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
- The Operator-Scheduling Problem: A Network-Flow Approach
