The general employee scheduling problem: an integration of MS and AI
Computers and Operations Research - Special issue: Applications of integer programming
Implicit modeling of flexible break assignments in optimal shift scheduling
Management Science
Improved implicit optimal modeling of the labor shift scheduling problem
Management Science
Optimal shift scheduling with multiple break windows
Management Science
Foundations of statistical natural language processing
Foundations of statistical natural language processing
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
Journal of Heuristics
A survey of very large-scale neighborhood search techniques
Discrete Applied Mathematics
Constraint Processing
Principles of Constraint Programming
Principles of Constraint Programming
Decomposing global grammar constraints
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Very large-scale neighborhood search techniques in timetabling problems
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
The theory of grammar constraints
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
A hybrid LS-CP solver for the shifts and breaks design problem
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
An improved memetic algorithm for break scheduling
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Retail store workforce scheduling by expected operating income maximization
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
A hybrid MIP/CP approach for multi-activity shift scheduling
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling
INFORMS Journal on Computing
A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem
Journal of Scheduling
| Hi-index | 0.00 |
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This problem becomes harder when multi-skill employees can perform many different activities during the same shift. In this paper, we show how formal languages (such as regular and context-free languages) can be enhanced and used to model the complex regulations of the shift construction problem. From these languages we can derive specialized graph structures that can be searched efficiently. The overall shift scheduling problem can then be solved using a Large Neighbourhood Search. These approaches are able to return near optimal solution on traditional single activity problems and they scale well on large instances containing up to 10 activities.