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

DOI10.1016/J.EJOR.2016.04.014zbMATH Open1346.90368OpenAlexW1171506936WikidataQ114184466 ScholiaQ114184466MaRDI QIDQ323346FDOQ323346

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

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

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)

Cites Work

• Title not available (Why is that?)
• Partitioning procedures for solving mixed-variables programming problems
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• The minimum shift design problem
• Generalized Benders decomposition
• Staff scheduling and rostering: a review of applications, methods and models.
• An annotated bibliography of personnel scheduling and rostering
• Personnel scheduling: a literature review
• Optimal Shift Scheduling with Multiple Break Windows
• Title not available (Why is that?)
• Interior point stabilization for column generation
• Using Benders decomposition to implicitly model tour scheduling
• Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
• Local search for shift design.
• A comparative evaluation of modeling approaches to the labor shift scheduling problem
• A simulated-annealing heuristic for shift scheduling using non-continuously available employees
• 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
• Title not available (Why is that?)
• The Operator-Scheduling Problem: A Network-Flow Approach
• Scheduler -- a system for staff planning

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)