Single item lot-sizing problem for a warm/cold process with immediate lost sales

被引:11
作者
Berk, Emre [1 ]
Toy, Ayhan Oezguer [1 ]
Hazir, Oencue [1 ]
机构
[1] Bilkent Univ, Fac Business Adm, TR-06800 Ankara, Turkey
关键词
dynamic lot sizing; warm/cold process; lost sales; setup times; setup costs; scheduling;
D O I
10.1016/j.ejor.2006.06.070
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider the dynamic lot-sizing problem with finite capacity and possible lost sales for a process that could be kept warm at a unit variable cost for the next period t + 1 only if more than a threshold value Q(t) has been produced and would be cold, otherwise. Production with a cold process incurs a fixed positive setup cost, K-t and setup time, S-t, which may be positive. Setup costs and times for a warm process are negligible. We develop a dynamic programming formulation of the problem, establish theoretical results on the structure of the optimal production plan in the presence of zero and positive setup times with Wagner-Whitin-type cost structures. We also show that the solution to the dynamic lot-sizing problem with lost sales are generated from the full commitment production series improved via lost sales decisions in the presence of a warm/cold process. (C) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码:1251 / 1267
页数:17
相关论文
共 32 条
[1]   IMPROVED ALGORITHMS FOR ECONOMIC LOT-SIZE PROBLEMS [J].
AGGARWAL, A ;
PARK, JK .
OPERATIONS RESEARCH, 1993, 41 (03) :549-571
[2]   Lotsizing with backlogging and start-ups: the case of Wagner-Whitin costs [J].
Agra, A ;
Constantino, M .
OPERATIONS RESEARCH LETTERS, 1999, 25 (02) :81-88
[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]   A review of scheduling research involving setup considerations [J].
Allahverdi, A ;
Gupta, JND ;
Aldowaisan, T .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1999, 27 (02) :219-239
[5]  
Allahverdi A., EUROPEAN J OPERATION
[6]  
BERK E, 2006, 20061 FAC BUSIN ADM
[7]   COMPUTATIONAL-COMPLEXITY OF THE CAPACITATED LOT SIZE PROBLEM [J].
BITRAN, GR ;
YANASSE, HH .
MANAGEMENT SCIENCE, 1982, 28 (10) :1174-1186
[8]  
BRAHIMI N, 2006, EUR J OPER RES, V168, P511
[9]   The discrete lot-sizing and scheduling problem:: Complexity and modification for batch availability [J].
Brüggemann, W ;
Jahnke, H .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 124 (03) :511-528
[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