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 条
  • [1] The capacitated lot sizing problem with overtime decisions and setup times
    Özdamar, L
    Bozyel, MA
    IIE TRANSACTIONS, 2000, 32 (11) : 1043 - 1057
  • [2] A capacitated lot sizing problem with stochastic setup times and overtime
    Tas, Duygu
    Gendreau, Michel
    Jabali, Ola
    Jans, Raf
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 273 (01) : 146 - 159
  • [3] An analysis of formulations for the capacitated lot sizing problem with setup crossover
    Fiorotto, Diego Jacinto
    Jans, Raf
    de Araujo, Silvio Alexandre
    COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 106 : 338 - 350
  • [4] The capacitated lot sizing problem with setup carry-over
    Sox, CR
    Gao, YB
    IIE TRANSACTIONS, 1999, 31 (02) : 173 - 181
  • [5] A hybrid approach for the capacitated lot sizing problem with setup carryover
    Goren, Hacer Guner
    Tunali, Semra
    Jans, Raf
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2012, 50 (06) : 1582 - 1597
  • [6] Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
    de Araujo, Silvio Alexandre
    De Reyck, Bert
    Degraeve, Zeger
    Fragkos, Ioannis
    Jans, Raf
    INFORMS JOURNAL ON COMPUTING, 2015, 27 (03) : 431 - 448
  • [7] A FRAMEWORK FOR MODELING SETUP CARRYOVER IN THE CAPACITATED LOT-SIZING PROBLEM
    GOPALAKRISHNAN, M
    MILLER, DM
    SCHMIDT, CP
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1995, 33 (07) : 1973 - 1988
  • [8] LP-based heuristics for the Capacitated Lot Sizing Problem
    Brandimarte, P
    Alfieri, A
    CIRP ANNALS 1998 - MANUFACTURING TECHNOLOGY, VOL 47, NO 1, 1998, 47 : 423 - 426
  • [9] Improved lower bounds for the capacitated lot sizing problem with setup times
    Jans, R
    Degraeve, Z
    OPERATIONS RESEARCH LETTERS, 2004, 32 (02) : 185 - 195
  • [10] Capacitated Lot-Sizing Problem with Sequence-Dependent Setup, Setup Carryover and Setup Crossover
    Kang, Jangha
    PROCESSES, 2020, 8 (07)