Capacitated Lot Sizing Problem with Family-based Setup and Downstream-process-based Demand

被引:0
|
作者
Zhao, Yuming [1 ]
Wang, Gongshu [2 ]
Yang, Yang [3 ]
Su, Lijie [4 ]
机构
[1] Northeastern Univ, Frontier Sci Ctr Ind Intelligence & Syst Optimiza, Shenyang, Peoples R China
[2] Northeastern Univ, Minist Educ, Key Lab Data Analyt & Optimizat Smart Ind, Shenyang, Peoples R China
[3] Northeastern Univ, Liaoning Key Lab Mfg Syst & Logist Optimizat, Shenyang, Peoples R China
[4] Northeastern Univ, Liaoning Engn Lab Data Analyt & Optimizat Smart I, Shenyang, Peoples R China
基金
中国国家自然科学基金;
关键词
COMPLEXITY; MODEL;
D O I
10.1109/CASE49997.2022.9926572
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We propose two formulations for the capacitated lot sizing problem with family-based setup and downstream-process-based demand (CLSP-FSDPD), one is the aggregate formulation (AGG) and the other one is the facility-location-based disaggregate formulation (FDG). We compare two formulations and extensive computational experiments show that FDG formulation outperforms AGG formulation in terms of solution quality when the planning horizon is relatively short, and AGG formulation consistently takes shorter CPU computation time that FDG formulation to solve in most cases. We show some of the differences in the performance of these various formulations arise from their different use of variables to represent production, setup or inventory states.
引用
收藏
页码:160 / 165
页数:6
相关论文
共 50 条
  • [31] Solving the capacitated lot sizing problem with setup carryover using a new sequential hybrid approach
    Goren, Hacer Guner
    Tunali, Semra
    APPLIED INTELLIGENCE, 2015, 42 (04) : 805 - 816
  • [32] Capacitated Stochastic Lot-sizing and Production Planning Problem Under Demand Uncertainty
    Seyfi, Seyed Amin
    Yilmaz, Gorkem
    Yanikoglu, Ihsan
    Garip, Alpaslan
    IFAC PAPERSONLINE, 2022, 55 (10): : 2731 - 2736
  • [33] A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
    Toledo, Franklina Maria Bragion
    Armentano, Vinicius Amaral
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 175 (02) : 1070 - 1083
  • [34] Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times
    Denizel, Meltem
    Altekin, F. Tevhide
    Sueral, Haldun
    Stadtler, Hartmut
    OR SPECTRUM, 2008, 30 (04) : 773 - 785
  • [35] Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times
    Meltem Denizel
    F. Tevhide Altekin
    Haldun Süral
    Hartmut Stadtler
    OR Spectrum, 2008, 30 : 773 - 785
  • [36] A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over
    Carvalho, Desiree M.
    Nascimento, Maria C. V.
    COMPUTERS & OPERATIONS RESEARCH, 2018, 100 : 43 - 53
  • [37] Motivations and analysis of the capacitated lot-sizing problem with setup times and minimum and maximum ending inventories
    Charles, Mehdi
    Dauzere-Peres, Stephane
    Kedad-Sidhoum, Safia
    Mazhoud, Issam
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 302 (01) : 203 - 220
  • [38] An HNP-MP Approach for the Capacitated Multi-Item Lot Sizing Problem With Setup Times
    Wu, Tao
    Shi, Leyuan
    Duffie, Neil A.
    IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2010, 7 (03) : 500 - 511
  • [39] Integrating run-based preventive maintenance into the capacitated lot sizing problem with reliability constraint
    Lu, Zhiqiang
    Zhang, Yuejun
    Han, Xiaole
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2013, 51 (05) : 1379 - 1391