Modeling and solving the constrained multi-items lot-sizing problem with time-varying setup cost

被引:6
作者
Zhou, Shenghan [1 ]
Zhou, Yuliang [1 ]
Zuo, Xiaorong [1 ]
Xiao, Yiyong [1 ]
Cheng, Yang [2 ]
机构
[1] Beihang Univ, Sch Reliabil & Syst Engn, Beijing 100191, Peoples R China
[2] Aalborg Univ, Ctr Ind Prod, Fredrik Bajers Vej 5, Aalborg, Denmark
基金
中国国家自然科学基金;
关键词
Lot-sizing problem; Time-varying environment; Capacity constraints; MILP; NEIGHBORHOOD SEARCH;
D O I
10.1016/j.chaos.2018.09.012
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The dynamic lot-sizing problem is highly complex and very important for the planning systems of manufacturing enterprises in time-varying environment, where production factors such as the production setup costs, unit storage costs, and production capacities may constantly rise or fall in different planning periods over the entire planning horizon. This paper proposed an extension model of the dynamic multi-product lot-sizing problem considering time-varying production setup cost and with dual constraints on dynamic capacities and resource limits, which carters for the actual situation of modern production and manufacturing systems in time-varying environments. Comparative experiments on synthesized problem instances were conducted by using the AMPL/CPLEX solver, which showed that the new model is efficiently on finding solutions with high qualities and the maximum size of test problems can be more than 500 products. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码:202 / 207
页数:6
相关论文
共 24 条
[1]   Analysis of Deterministic Control and Its Improvements for an Inventory Problem with Multiproduct Batch Differentiation [J].
Ahn, Hyun-Soo ;
Jasin, Stefanus ;
Kaminsky, Philip ;
Wang, Yang .
OPERATIONS RESEARCH, 2018, 66 (01) :58-76
[2]   NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract [J].
Akbalik, Ayse ;
Hadj-Alouane, Atidel B. ;
Sauer, Nathalie ;
Ghribi, Houcem .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 257 (02) :483-493
[3]  
[Anonymous], 2017, APPL MATH NONLIN SCI
[4]   COMPUTATIONAL-COMPLEXITY OF UNCAPACITATED MULTI-ECHELON PRODUCTION PLANNING PROBLEMS [J].
ARKIN, E ;
JONEJA, D ;
ROUNDY, R .
OPERATIONS RESEARCH LETTERS, 1989, 8 (02) :61-66
[5]   Dynamic programming approximation algorithms for the capacitated lot-sizing problem [J].
Buyuktahtakin, I. Esra ;
Liu, Ning .
JOURNAL OF GLOBAL OPTIMIZATION, 2016, 65 (02) :231-259
[6]  
Chen M., 2017, the International Encyclopedia of Geography: People the Earth, Environment and Technology, P1
[7]   A BRANCH-AND-BOUND ALGORITHM FOR COMPUTING OPTIMAL REPLACEMENT POLICIES IN K-OUT-OF-N SYSTEMS [J].
CHUNG, CS ;
FLYNN, J .
OPERATIONS RESEARCH, 1995, 43 (05) :826-837
[8]   A dynamic multi-plant lot-sizing and distribution problem [J].
Darvish, Maryam ;
Larrain, Homero ;
Coelho, Leandro C. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2016, 54 (22) :6707-6717
[9]  
Grubor A., 2016, Industrija, V44, P67
[10]   Exploiting timely demand information in determining production lot-sizing: an exploratory study [J].
Gu, Qiannong ;
Visich, John K. ;
Li, Kunpeng ;
Wang, Ziping .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2017, 55 (16) :4531-4543