Search

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.