Solving the shift and break design problem using integer linear programming

1Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Akkermans, A., Post, G., & Uetz, M. (2021). Solving the shift and break design problem using integer linear programming. Annals of Operations Research, 302(2), 341–362. https://doi.org/10.1007/s10479-019-03487-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free