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 条