A large neighbourhood search approach to the multi-activity shift scheduling problem
From MaRDI portal
Publication:972651
DOI10.1007/s10732-009-9106-6zbMath1187.90141OpenAlexW2114085960MaRDI QIDQ972651
Louis-Martin Rousseau, Claude-Guy Quimper
Publication date: 21 May 2010
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-009-9106-6
context-free languagesregular languageslarge neighborhood searchshift schedulingemployee timetablingvery-large scale neighborhood
Related Items
An implicit model for multi-activity shift scheduling problems ⋮ Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce ⋮ Branch-and-Price for Personalized Multiactivity Tour Scheduling ⋮ Combining Benders decomposition and column generation for multi-activity tour scheduling ⋮ Modeling and solving a real-life multi-skill shift design problem ⋮ A decomposition-based heuristic for large employee scheduling problems with inter-department transfers ⋮ A two-stage stochastic programming approach for multi-activity tour scheduling ⋮ A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem ⋮ An exact bidirectional pulse algorithm for the constrained shortest path ⋮ Formal languages for integer programming modeling of shift scheduling problems ⋮ Solving shift scheduling problem with days-off preference for power station workers using binary integer goal programming model ⋮ A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem ⋮ The weighted grammar constraint ⋮ Orbital shrinking: theory and applications ⋮ 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 survey of very large-scale neighborhood search techniques
- A \texttt{cost-regular} based hybrid column generation approach
- Staff scheduling and rostering: a review of applications, methods and models.
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- A distributed genetic algorithm for deterministic and stochastic labor scheduling problems
- An annotated bibliography of personnel scheduling and rostering
- 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
- Principles of Constraint Programming
- Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems
- Modeling the Regular Constraint with Integer Programming
- A Simulated Annealing Approach to the Solution of Flexible Labour Scheduling Problems
- Optimal Shift Scheduling with Multiple Break Windows
- Improved Implicit Optimal Modeling of the Labor Shift Scheduling Problem
- Recognition and parsing of context-free languages in time n3
- Principles and Practice of Constraint Programming – CP 2004
- Using constraint-based operators to solve the vehicle routing problem with time windows
