Paper Info
Title
Solving the shift and break design problem using integer linear programming
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.
Year
DOI
Venue
2021
10.1007/s10479-019-03487-6
Annals of Operations Research
Keywords
DocType
Volume
Shift design, Break scheduling, Timetabling
Journal
302
Issue
ISSN
Citations 
2
1572-9338
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Arjan Akkermans100.34
Gerhard F. Post217816.65
Marc Uetz345643.99