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

Abstract 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.

[1]  G. D. Eppen,et al.  Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition , 1987, Oper. Res..

[2]  Alan S. Manne,et al.  Programming of Economic Lot Sizes , 1958 .

[3]  Uday S. Karmarkar,et al.  The Dynamic Lot-Sizing Problem with Startup and Reservation Costs , 1987, Oper. Res..

[4]  K. Hindi.  Solving the single-item, capacitated dynamic lot-sizing problem with startup and reservation costs by tabu search , 1995 .

[5]  D. Simchi-Levi,et al.  Controllable production rates in a family production context , 1991 .

[6]  B. Fleischmann.  The discrete lot-sizing and scheduling problem , 1990 .

[7]  Alok Aggarwal,et al.  Improved Algorithms for Economic Lot Size Problems , 1993, Oper. Res..

[8]  John M. Wilson,et al.  The capacitated lot sizing problem: a review of models and algorithms , 2003 .

[9]  Powell E. Robinson,et al.  Economic Production Lot Sizing with Periodic Costs and Overtime , 2001, Decis. Sci..

[10]  Suresh Chand,et al.  The single-item lot-sizing problem with immediate lost sales , 2003, Eur. J. Oper. Res..

[11]  Albert P. M. Wagelmans,et al.  An $O(T^3)$ algorithm for the economic lot-sizing problem with constant capacities , 1993 .

[12]  E. Silver.  Deliberately slowing down output in a family production context , 1990 .

[13]  Stéphane Dauzère-Pérès,et al.  Single item lot sizing problems , 2006, Eur. J. Oper. Res..

[14]  Chien-Hua M. Lin,et al.  An OT2 Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem , 1988 .

[15]  Ayhan Özgür Toy,et al.  Dynamic lot sizing problem for a warm/cold process , 2006 .

[16]  Gerald L. Thompson,et al.  A Forward Algorithm for the Capacitated Lot Size Model with Stockouts , 1990, Oper. Res..

[17]  Laurence A. Wolsey,et al.  Algorithms and reformulations for lot sizing problems , 1994, Combinatorial Optimization.

[18]  Laurence A. Wolsey,et al.  Progress With Single-item Lot-sizing , 1995 .

[19]  G. Bitran,et al.  Computational Complexity of the Capacitated Lot Size Problem , 1982 .

[20]  A. Banerjee,et al.  Production lot sizing with variable production rate and explicit idle capacity cost , 1999 .

[21]  Laurence A. Wolsey,et al.  Dynamic knapsack sets and capacitated lot-sizing , 2003, Math. Program..

[22]  Miguel Fragoso Constantino,et al.  Lotsizing with backlogging and start-ups: the case of Wagner-Whitin costs , 1999, Oper. Res. Lett..

[23]  Harvey M. Wagner,et al.  Dynamic Version of the Economic Lot Size Model , 2004, Manag. Sci..

[24]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[25]  Khalil S. Hindi,et al.  Efficient Solution of the Single-item, Capacitated Lot-sizing Problem with Start-up and Reservation Costs , 1995 .

[26]  Diwakar Gupta,et al.  The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times , 2005, Comput. Oper. Res..

[27]  Guillermo Gallego.  Reduced production rates in the economic lot scheduling problem , 1993 .

[28]  Hermann Jahnke,et al.  The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability , 2000, Eur. J. Oper. Res..

[29]  M. Florian,et al.  DETERMINISTIC PRODUCTION PLANNING WITH CONCAVE COSTS AND CAPACITY CONSTRAINTS. , 1971 .

[30]  Feng Chu,et al.  A forward algorithm for capacitated lot sizing problem with lost sales , 2004, Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788).