Integrated lot sizing in serial supply chains with production capacities

被引:69
作者
van Hoesel, S
Romeijn, HE
Morales, DR
Wagelmans, APM
机构
[1] Maastricht Univ, Fac Econ & Business Adm, NL-6200 MD Maastricht, Netherlands
[2] Univ Florida, Dept Ind & Syst Engn, Gainesville, FL 32611 USA
[3] Univ Oxford, Said Business Sch, Oxford OX1 1HP, England
[4] Erasmus Univ, Inst Econometr, NL-3000 DR Rotterdam, Netherlands
关键词
lot sizing; integration of production planning and transportation; dynamic programming; polynomial time algorithms;
D O I
10.1287/mnsc.1050.0378
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider a model for a serial supply chain in which production, inventory, and transportation decisions are integrated in the presence of production capacities and concave cost functions. The model we study generalizes the uncapacitated serial single-item multilevel economic lot-sizing model by adding stationary production capacities at the manufacturer level. We present algorithms with a running time that is polynomial in the planning horizon when all cost functions are concave. In addition, we consider different transportation and inventory holding cost structures that yield improved running times: inventory holding cost functions that are linear and transportation cost functions that are either linear, or are concave with a fixed-charge structure. In the latter case, we make the additional common and reasonable assumption that the variable transportation and inventory costs are such that holding inventories at higher levels in the supply chain is more attractive from a variable cost perspective. While the running times of the algorithms are exponential in the number of levels in the supply chain in the general concave cost case, the running times are remarkably insensitive to the number of levels for the other two cost structures.
引用
收藏
页码:1706 / 1719
页数:14
相关论文
共 20 条
[1]   IMPROVED ALGORITHMS FOR ECONOMIC LOT-SIZE PROBLEMS [J].
AGGARWAL, A ;
PARK, JK .
OPERATIONS RESEARCH, 1993, 41 (03) :549-571
[2]  
Ahuja RK, 1993, NETWORK FLOWS THEORY
[3]  
[Anonymous], 1978, MANAGE SCI
[4]   GLOBAL SUPPLY CHAIN MANAGEMENT AT DIGITAL-EQUIPMENT-CORPORATION [J].
ARNTZEN, BC ;
BROWN, GG ;
HARRISON, TP ;
TRAFTON, LL .
INTERFACES, 1995, 25 (01) :69-93
[5]   COMPUTATIONAL-COMPLEXITY OF THE CAPACITATED LOT SIZE PROBLEM [J].
BITRAN, GR ;
YANASSE, HH .
MANAGEMENT SCIENCE, 1982, 28 (10) :1174-1186
[6]   COORDINATION OF PRODUCTION AND DISTRIBUTION PLANNING [J].
CHANDRA, P ;
FISHER, ML .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 72 (03) :503-517
[7]   AN O(T2) ALGORITHM FOR THE NI/G/NI/ND CAPACITATED LOT SIZE PROBLEM [J].
CHUNG, CS ;
LIN, CHM .
MANAGEMENT SCIENCE, 1988, 34 (03) :420-426
[8]   A SIMPLE FORWARD ALGORITHM TO SOLVE GENERAL DYNAMIC LOT SIZING MODELS WITH N PERIODS IN 0(N LOG N) OR 0(N) TIME [J].
FEDERGRUEN, A ;
TZUR, M .
MANAGEMENT SCIENCE, 1991, 37 (08) :909-925
[9]   DETERMINISTIC PRODUCTION PLANNING WITH CONCAVE COSTS AND CAPACITY CONSTRAINTS [J].
FLORIAN, M ;
KLEIN, M .
MANAGEMENT SCIENCE SERIES A-THEORY, 1971, 18 (01) :12-20
[10]   DETERMINISTIC PRODUCTION PLANNING - ALGORITHMS AND COMPLEXITY [J].
FLORIAN, M ;
LENSTRA, JK ;
RINNOOYKAN, AHG .
MANAGEMENT SCIENCE, 1980, 26 (07) :669-679