Journal of Scheduling

, Volume 17, Issue 2, pp 185–197

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

  • Vincent Boyer
  • Bernard Gendron
  • Louis-Martin Rousseau
Article

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.

Keywords

Multi-activity multi-task shift scheduling problem Precedence constraints Branch-and-price Context-free grammar 

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Vincent Boyer
    • 1
    • 2
  • Bernard Gendron
    • 1
  • Louis-Martin Rousseau
    • 1
  1. 1.Centre interuniversitaire de recherche sur les réseaux d’Entreprise, la logistique et le transport Université de MontréalMontrealCanada
  2. 2.Graduate Program in Systems EngineeringUniversidad Autónoma de Nuevo León (UANL)San Nicolás de los GarzaMexico

Personalised recommendations