Solver independent rotating workforce scheduling

Nysret Musliu, Andreas Schutt, Peter J. Stuckey

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

2 Citations (Scopus)

Abstract

The rotating workforce scheduling problem aims to schedule workers satisfying shift sequence constraints and ensuring enough shifts are covered on each day, where every worker completes the same schedule, just starting at different days in the schedule. We give two solver independent models for the rotating workforce scheduling problem and compare them using different solving technology, both constraint programming and mixed integer programming. We show that the best of these models outperforms the state-of-the-art for the rotating workforce scheduling problem, and that solver independent modeling allows us to use different solvers to achieve different aims: e.g., speed to solution or robustness of solving (particular for unsatisfiable problems). We give the first complete method able to solve all of the standard benchmarks for this problem.

Original languageEnglish
Title of host publicationIntegration of Constraint Programming, Artificial Intelligence, and Operations Research
Subtitle of host publication15th International Conference, CPAIOR 2018 Delft, The Netherlands, June 26–29, 2018 Proceedings
EditorsWillem-Jan van Hoeve
Place of PublicationCham Switzerland
PublisherSpringer
Pages429-445
Number of pages17
ISBN (Electronic)9783319930312
ISBN (Print)9783319930305
DOIs
Publication statusPublished - 2018
Externally publishedYes
EventInternational Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems 2018 - Delft, Netherlands
Duration: 26 Jun 201829 Jun 2018
Conference number: 15th
https://sites.google.com/view/cpaior2018

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume10848
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems 2018
Abbreviated titleCPAIOR 2018
CountryNetherlands
CityDelft
Period26/06/1829/06/18
Internet address

Cite this

Musliu, N., Schutt, A., & Stuckey, P. J. (2018). Solver independent rotating workforce scheduling. In W-J. van Hoeve (Ed.), Integration of Constraint Programming, Artificial Intelligence, and Operations Research: 15th International Conference, CPAIOR 2018 Delft, The Netherlands, June 26–29, 2018 Proceedings (pp. 429-445). (Lecture Notes in Computer Science; Vol. 10848 ). Springer. https://doi.org/10.1007/978-3-319-93031-2_31