License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.09261.9
URN: urn:nbn:de:0030-drops-21775
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2009/2177/
Go to the corresponding Portal

Cote, Marie-Claude ; Gendron, Bernard ; Rousseau, Louis-Martin

Grammar-Based Integer Programing Models for Multi-Activity Shift Scheduling

pdf-format:
09261.RousseauLouisMartin.ExtAbstract.2177.pdf (0.09 MB)

Abstract

We present a new implicit formulation for shift scheduling problems, using context-free grammars to model regulation in the composition of shifts. From the grammar, we generate an integer programming (IP) model allowing the same set of shifts as Dantzig’s set covering model. When solved by a state-of-the- art IP solver on problems allowing a small number of shifts, our model, the set covering formulation and a typical implicit model from the literature yield comparable solving times. Moreover, on instances where many shifts are allowed, our model is superior and can encode a wider variety of constraints. Among others, multi-activity cases, which cannot be modeled by existing implicit formulations, can easily be captured with grammars.

BibTeX - Entry

@InProceedings{cote_et_al:DagSemProc.09261.9,
  author =	{Cote, Marie-Claude and Gendron, Bernard and Rousseau, Louis-Martin},
  title =	{{Grammar-Based Integer Programing Models for Multi-Activity Shift Scheduling}},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9261},
  editor =	{Cynthia Barnhart and Uwe Clausen and Ulrich Lauther and Rolf H. M\"{o}hring},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2009/2177},
  URN =		{urn:nbn:de:0030-drops-21775},
  doi =		{10.4230/DagSemProc.09261.9},
  annote =	{Keywords: Shift Scheduling, Implicit models, Integer Programming, Context-free grammars}
}

Keywords: Shift Scheduling, Implicit models, Integer Programming, Context-free grammars
Collection: 09261 - Models and Algorithms for Optimization in Logistics
Issue Date: 2009
Date of publication: 02.10.2009

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI