Formal languages for integer programming modeling of shift scheduling problems

DOI10.1007/s10601-009-9083-2zbMath1215.90026OpenAlexW2111805524MaRDI QIDQ2430360

Bernard Gendron, Claude-Guy Quimper, Marie-Claude Côté, Louis-Martin Rousseau

Publication date: 6 April 2011

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-009-9083-2

zbMATH Keywords

integer programmingformal languagesconstraint programmingreformulations

Mathematics Subject Classification ID

Mixed integer programming (90C11) Formal languages and automata (68Q45) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (18)

An implicit model for multi-activity shift scheduling problems ⋮ Retail store scheduling for profit ⋮ Branch-and-Price for Personalized Multiactivity Tour Scheduling ⋮ Combining Benders decomposition and column generation for multi-activity tour scheduling ⋮ On an exact method for the constrained shortest path problem ⋮ Modeling and solving a real-life multi-skill shift design problem ⋮ A MinCumulative resource constraint ⋮ A two-stage stochastic programming approach for multi-activity tour scheduling ⋮ A two-phase mathematical-programming heuristic for flexible assignment of activities and tasks to work shifts ⋮ A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem ⋮ Assigning Team Tasks and Multiple Activities to Fixed Work Shifts ⋮ The Weighted Cfg Constraint ⋮ A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem ⋮ Orbital shrinking: theory and applications ⋮ New approaches to nurse rostering benchmark instances ⋮ A two-stage solution approach for personalized multi-department multi-day shift scheduling ⋮ Solving multi-activity multi-day shift scheduling problems with a hybrid heuristic ⋮ Learning to reduce state-expanded networks for multi-activity shift scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using Benders decomposition to implicitly model tour scheduling
• A \texttt{cost-regular} based hybrid column generation approach
• A large neighbourhood search approach to the multi-activity shift scheduling problem
• Rotating schedules
• Cyclic and non-cyclic scheduling of 12h shift nurses by network programming
• Staff scheduling and rostering: a review of applications, methods and models.
• An annotated bibliography of personnel scheduling and rostering
• A flexible, fast, and optimal modeling approach applied to crew rostering at London Underground
• An integer programming model for the weekly tour scheduling problem
• A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows
• Decomposing Global Grammar Constraints
• The Theory of Grammar Constraints
• Global Grammar Constraints
• Sequencing and Counting with the multicost-regular Constraint
• Optimal Shift Scheduling with Multiple Break Windows
• Improved Implicit Optimal Modeling of the Labor Shift Scheduling Problem
• Constraint Programming Based Column Generation for Employee Timetabling
• Recognition and parsing of context-free languages in time n3
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Formal languages for integer programming modeling of shift scheduling problems