Solving the Shifts and Breaks Design Problem Using Integer Linear Programming

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

1 Citation (Scopus)
67 Downloads (Pure)

Abstract

In this paper we propose a two-phase approach to the shifts and breaks 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. This approach outperforms the current best known method for shifts and breaks design on a set of benchmark instances, as well as on real life instances.
Original languageEnglish
Title of host publicationPATAT 2018: Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling
EditorsE.K. Burke, L. Di Gaspero, B McCollum, N. Musliu, E. Özcan
Pages137-152
ISBN (Electronic)978-0-9929984-2-4
Publication statusPublished - 2018
EventPATAT 2018: 12th International Conference on the Practice and Theory of Automated Timetabling - TU Wien Faculty of Electrical Engineering, Vienna, Austria
Duration: 28 Aug 201831 Aug 2018
Conference number: 12
http://patatconference.org/patat2018/

Conference

ConferencePATAT 2018
Abbreviated titlePATAT 2018
CountryAustria
CityVienna
Period28/08/1831/08/18
Internet address

Fingerprint

Dive into the research topics of 'Solving the Shifts and Breaks Design Problem Using Integer Linear Programming'. Together they form a unique fingerprint.

Cite this