Cut generation for an employee timetabling problem

DOI10.1016/j.ejor.2008.03.036zbMath1176.90413OpenAlexW2064422611MaRDI QIDQ1042034

Boris Detienne, David Rivreau, Laurent Peridy, Éric Pinson

Publication date: 7 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.03.036

zbMATH Keywords

Benders decompositionemployee timetabling problemmulti-choice multi-dimensional knapsack problem

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

A workforce planning and allocation model for the outbound baggage loading area at Santiago International Airport ⋮ Workforce planning incorporating skills: state of the art ⋮ Branch-and-Price for Personalized Multiactivity Tour Scheduling ⋮ Combining Benders decomposition and column generation for multi-activity tour scheduling ⋮ Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem ⋮ A two-stage stochastic programming approach for multi-activity tour scheduling ⋮ Joint employee weekly timetabling and daily rostering: a decision-support tool for a logistics platform ⋮ A three-stage mixed integer programming approach for optimizing the skill mix and training schedules for aircraft maintenance ⋮ Cut generation for an integrated employee timetabling and production scheduling problem

Cites Work

• Partitioning procedures for solving mixed-variables programming problems
• Staff scheduling and rostering: a review of applications, methods and models.
• Validation of subgradient optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item