Branch-and-Price for Personalized Multiactivity Tour Scheduling
From MaRDI portal
Publication:3186663
DOI10.1287/ijoc.2015.0683zbMath1343.90040OpenAlexW2325136417MaRDI QIDQ3186663
Louis-Martin Rousseau, Maria I. Restrepo, Bernard Gendron
Publication date: 12 August 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2015.0683
context-free grammarsbranch and priceshortest path problem with resource constraintsmultiactivity tour scheduling problem
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (4)
Combining Benders decomposition and column generation for multi-activity tour scheduling ⋮ The flexible break assignment problem for large tour scheduling problems with an application to airport ground handlers ⋮ Instance space analysis for a personnel scheduling problem ⋮ A two-stage solution approach for personalized multi-department multi-day shift scheduling
Uses Software
Cites Work
- Unnamed Item
- Flexible weekly tour scheduling for postal service workers using a branch and price
- 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
- Using Benders decomposition to implicitly model tour scheduling
- A \texttt{cost-regular} based hybrid column generation approach
- Implicit shift scheduling with multiple breaks and work stretch duration restrictions
- A large neighbourhood search approach to the multi-activity shift scheduling problem
- Cut generation for an employee timetabling problem
- Personnel scheduling: a literature review
- Stabilized branch and price with dynamic parameter updating for discontinuous tour scheduling
- Grammar constraints
- Solving multi-activity multi-day shift scheduling problems with a hybrid heuristic
- Formal languages for integer programming modeling of shift scheduling problems
- A branch-and-price approach for large-scale employee tour scheduling problems
- An integer programming model for the weekly tour scheduling problem
- Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling
- Optimal Models for Meal-Break and Start-Time Flexibility in Continuous Tour Scheduling
- A column generation approach for an employee scheduling problem with multiple shifts and work locations
- Decomposing Global Grammar Constraints
- The Theory of Grammar Constraints
- Global Grammar Constraints
- Modeling the Regular Constraint with Integer Programming
- The Polytope of Context-Free Grammar Constraints
- Solving Large-Scale Tour Scheduling Problems
- Optimal Shift Scheduling with Multiple Break Windows
- Overlapping Start-Time Bands in Implicit Tour Scheduling
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: Branch-and-Price for Personalized Multiactivity Tour Scheduling
