Solving the shift and break design problem using integer linear programming

Arjan Akkermans, Gerhard Post*, Marc Uetz

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)
29 Downloads (Pure)

Abstract

In this paper we propose a two-phase approach to solve the shift and break design problem using integer linear programming. In the first phase we create the shifts, while heuristically taking the breaks into account. In the second phase we assign breaks to each occurrence of any shift, one by one, repeating this until no improvement is found. On a set of benchmark instances, composed by both randomly-generated and real-life ones, this approach obtains better results than the current best known method for shift and break design problem.

Original languageEnglish
Number of pages22
JournalAnnals of operations research
DOIs
Publication statusE-pub ahead of print/First online - 4 Dec 2019

Keywords

  • Break scheduling
  • Shift design
  • Timetabling

Fingerprint Dive into the research topics of 'Solving the shift and break design problem using integer linear programming'. Together they form a unique fingerprint.

Cite this