Polynomial algorithms for single-item lot-sizing models with bounded inventory and backlogging or outsourcing

被引:25
作者
Chu, Feng [1 ]
Chu, Chengbin
机构
[1] Univ Technol Troyes, LOSI, F-10010 Troyes, France
[2] Hefei Univ Technol, Sch Management, Hefei 230009, Peoples R China
关键词
actuated inventory bounds; algorithms; backlogging; capacitated lot sizing; complexity; dynamic programming; outsourcing;
D O I
10.1109/TASE.2006.880855
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper addresses a real-life single-item dynamic lot sizing problem arising in a refinery for crude oil procurement. It can be considered as a lot sizing problem with bounded inventory. We consider two managerial policies. With one policy, a part of the demand of a period can be backlogged and with the other, a part of the demand of a period can be outsourced. We define actuated inventory bounds and show that any bounded inventory lot sizing model can be transformed into an equivalent model with actuated inventory bounds. The concept of actuated inventory bounds significantly contributes to the complexity reduction. In the studied models, the production capacity can be assumed to be unlimited and the production cost functions to be linear ut with fixed charges. The results can be easily extended to piecewise linear concave production cost functions. The goal is to minimize the total cost of production, inventory holding and backlogging, or outsourcing. We show that the backlogging model can be solved in O(T-2) time with general concave inventory holding and backlogging cost functions where T is the number of periods in the planning horizon. The complexity is reduced to O(T) when the inventory/backlogging cost functions are linear and there is no speculative motives to hold either inventory or backlogging. When the outsourcing levels are unbounded, we show that the outsourcing model can be transformed into an inventory/backlogging model. As a consequence, the problem can be solved in O(T-2) time, if the outsourcing cost functions are linear with fixed charges even if the inventory holding cost functions are general concave functions. When the outsourcing level of a period is bounded from above by the demand of the period, which is the case in many application areas, we show that the outsourcing model can be solved in O(T-2 log T) time if the inventory holding and the outsourcing cost functions are linear.
引用
收藏
页码:233 / 251
页数:19
相关论文
共 30 条
[1]   IMPROVED ALGORITHMS FOR ECONOMIC LOT-SIZE PROBLEMS [J].
AGGARWAL, A ;
PARK, JK .
OPERATIONS RESEARCH, 1993, 41 (03) :549-571
[2]  
AHUJA R, 2004, SOLVING LINEAR COST
[3]   The single-item lot-sizing problem with immediate lost sales [J].
Aksen, D ;
Altinkemer, K ;
Chand, S .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 147 (03) :558-566
[4]  
[Anonymous], 1978, MANAGE SCI
[5]   Capacity acquisition, subcontracting, and lot sizing [J].
Atamtürk, A ;
Hochbaum, DS .
MANAGEMENT SCIENCE, 2001, 47 (08) :1081-1100
[6]  
ATAMTURK A, 2005, OPER RES
[7]   COMPUTATIONAL-COMPLEXITY OF THE CAPACITATED LOT SIZE PROBLEM [J].
BITRAN, GR ;
YANASSE, HH .
MANAGEMENT SCIENCE, 1982, 28 (10) :1174-1186
[8]   PLANNING HORIZONS FOR DYNAMIC LOT SIZE MODEL WITH BACKLOGGING [J].
BLACKBURN, JD ;
KUNREUTHER, H .
MANAGEMENT SCIENCE SERIES A-THEORY, 1974, 21 (03) :251-255
[9]   A NEW DYNAMIC-PROGRAMMING ALGORITHM FOR THE SINGLE ITEM CAPACITATED DYNAMIC LOT-SIZE MODEL [J].
CHEN, HD ;
HEARN, DW ;
LEE, CY .
JOURNAL OF GLOBAL OPTIMIZATION, 1994, 4 (03) :285-300
[10]   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