Solution approaches to large shift scheduling problems

DOI10.1051/ro:2008006zbMath1154.90483MaRDI QIDQ3539809

Jean-François Cordeau, François Soumis, Monia Rekik

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/

zbMATH Keywords

heuristic; flexibility; shift scheduling; local branching; forward and backward constraints; work stretch restrictions; fractionable breaks

Mathematics Subject Classification ID

90C11: Mixed integer programming

90C29: Multi-objective and goal programming

90B35: Deterministic scheduling theory in operations research

Related Items

Implicit shift scheduling with multiple breaks and work stretch duration restrictions, Accelerating Benders method using covering cut bundle generation

Cites Work

• Using Benders decomposition to implicitly model tour scheduling
• Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
• Variable neighborhood search
• Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations
• Local branching
• A comparative evaluation of modeling approaches to the labor shift scheduling problem
• Exploring relaxation induced neighborhoods to improve MIP solutions
• A simulated-annealing heuristic for shift scheduling using non-continuously available employees
• Bechtold-Jacobs generalized model for shift scheduling with extraordinary overlap
• A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows
• Optimal Shift Scheduling with Multiple Break Windows
• Reformulating linear programs with transportation constraints-With applications to workforce scheduling
• Improved Implicit Optimal Modeling of the Labor Shift Scheduling Problem
• Starting-time decisions in labor tour scheduling: An experimental analysis and case study