A reformulation for the stochastic lot sizing problem with service-level constraints

TUNÇ H., Kilic O. A. p., Tarim Ş. A., Eksioglu B.

OPERATIONS RESEARCH LETTERS, cilt.42, sa.2, ss.161-165, 2014 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 42 Sayı: 2
  • Basım Tarihi: 2014
  • Doi Numarası: 10.1016/j.orl.2014.01.010
  • Dergi Adı: OPERATIONS RESEARCH LETTERS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.161-165
  • Hacettepe Üniversitesi Adresli: Evet

Özet

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. (C) 2014 Elsevier B.V. All rights reserved.