Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1142170 | Operations Research Letters | 2014 | 5 Pages |
Abstract
We study the stochastic lot-sizing problem with service level constraints and propose an efficient mixed integer reformulation thereof. We use the formulation of the problem present in the literature as a benchmark, and prove that the reformulation has a stronger linear relaxation. Also, we numerically illustrate that it yields a superior computational performance. The results of our numerical study reveals that the reformulation can optimally solve problem instances with planning horizons over 200 periods in less than a minute.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Huseyin Tunc, Onur A. Kilic, S. Armagan Tarim, Burak Eksioglu,