A Benders decomposition-based matheuristic for the cardinality constrained shift design problem

DOI10.1016/J.EJOR.2016.04.014MaRDI QIDQ323346zbMATH OpenOpenAlexWikidataFDO

Authors Richard M. Lusby, Troels Martin Range, Jesper Larsen

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

zbMATH Keywords

integer programmingschedulingBenders decompositionshift design

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Recommendations

• Using Benders decomposition to implicitly model tour scheduling
• The minimum shift design problem: theory and practice
• scientific article; zbMATH DE number 1462943
• Modeling and solving a real-life multi-skill shift design problem
• Optimal Shift Scheduling with Multiple Break Windows

Cites work

• scientific article; zbMATH DE number 3819432 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 1462943 (Why is no real title available?)
• A comparative evaluation of modeling approaches to the labor shift scheduling problem
• A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows
• A simulated-annealing heuristic for shift scheduling using non-continuously available employees
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• An annotated bibliography of personnel scheduling and rostering
• Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
• Generalized Benders decomposition
• Integrated simulation, heuristic and optimisation approaches to staff scheduling
• Interior point stabilization for column generation
• Local search for shift design.
• Optimal Shift Scheduling with Multiple Break Windows
• Partitioning procedures for solving mixed-variables programming problems
• Personnel scheduling: a literature review
• Scheduler -- a system for staff planning
• Staff scheduling and rostering: a review of applications, methods and models.
• The Operator-Scheduling Problem: A Network-Flow Approach
• The minimum shift design problem
• Using Benders decomposition to implicitly model tour scheduling

Cited in

(1)

• Multi-period green reverse logistics network design: an improved Benders-decomposition-based heuristic approach

This page was built for publication: A Benders decomposition-based matheuristic for the cardinality constrained shift design problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323346)