Implicit modeling of flexible break assignments in optimal shift scheduling
Management Science
Optimal shift scheduling with multiple break windows
Management Science
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Constraint Programming Based Column Generation for Crew Assignment
Journal of Heuristics
Groups and Constraints: Symmetry Breaking during Search
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Selected Topics in Column Generation
Operations Research
Sequencing and Counting with the multicost-regular Constraint
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Constraints
Decomposing global grammar constraints
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
A large neighbourhood search approach to the multi-activity shift scheduling problem
Journal of Heuristics
Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling
Management Science
Assigning multiple activities to work shifts
Journal of Scheduling
Hi-index | 0.00 |
We present a branch-and-price algorithm to solve personalized multi-activity shift scheduling problems. The subproblems in the column generation method are formulated using grammars and solved with dynamic programming. The expressiveness of context-free grammars is exploited to easily model restrictions over shifts, allowing the branch-and-price algorithm to solve large-scale problem instances. We present computational experiments on two types of multi-activity shift scheduling problems and compare our approach with existing methods in the literature. These experiments show that our approach can efficiently solve large-scale instances and is flexible enough to model different classes of problems.