Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times

Denizel M., ALTEKİN F. T., SÜRAL H., Stadtler H.

OR SPECTRUM, cilt.30, sa.4, ss.773-785, 2008 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 30 Sayı: 4
  • Basım Tarihi: 2008
  • Doi Numarası: 10.1007/s00291-007-0094-3
  • Dergi Adı: OR SPECTRUM
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.773-785
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

The multi-item Capacitated Lot-Sizing Problem (CLSP) has been widely studied in the literature due to its relevance to practice, such as its application in constructing a master production schedule. The problem becomes more realistic with the incorporation of setup times since they may use up significant amounts of the available resource capacity. In this paper, we present a proof to show the linear equivalence of the Shortest Path (SP) formulation and the Transportation Problem (TP) formulation for CLSP with setup costs and times. Our proof is based on a linear transformation from TP to SP and vice versa. In our proof, we explicitly consider the case when there is no demand for an item in a period, a case that is frequently observed in the real world and in test problems in the literature. The equivalence result in this paper has an impact on the choice of model formulation and the development of solution procedures.