A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem

Authors:
Vincent Boyer;Bernard Gendron;Louis-Martin Rousseau
Affiliations:
Centre interuniversitaire de recherche sur les réseaux d'Entreprise, la logistique et le transport, Université de Montréal, Montreal, Canada H3C 3J7 and Graduate Program in Systems ...;Centre interuniversitaire de recherche sur les réseaux d'Entreprise, la logistique et le transport, Université de Montréal, Montreal, Canada H3C 3J7;Centre interuniversitaire de recherche sur les réseaux d'Entreprise, la logistique et le transport, Université de Montréal, Montreal, Canada H3C 3J7
Venue:
Journal of Scheduling
Year:
2014

Citing 12
Cited 0

Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
Parallel Machine Scheduling by Column Generation

Operations Research
Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems

Operations Research
A Cost-Regular Based Hybrid Column Generation Approach

Constraints
A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry

Computers and Operations Research
Decomposing global grammar constraints

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
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
Formal languages for integer programming modeling of shift scheduling problems

Constraints
Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment

INFORMS Journal on Computing
Assigning multiple activities to work shifts

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

The multi-activity multi-task shift scheduling problem requires the assignment of interruptible activities and uninterruptible tasks to a set of employees in order to satisfy a demand function. In this paper, we consider the personalized variant of the problem where the employees have different qualifications, preferences, and availabilities. We present a branch-and-price algorithm to solve this problem. The pricing subproblems in column generation are formulated with context-free grammars that are able to model complex rules in the construction of feasible shifts for an employee. We present results for a large set of instances inspired by real cases and show that this approach is sufficiently flexible to handle different classes of problems.