Production lot-sizing with dynamic capacity adjustment

Abstract In this paper we study a single-item lot-sizing model in which production capacity can be adjusted from time to time. There are a number of different production capacity levels available to be acquired in each period, where each capacity level is assumed to be a multiple of a base capacity unit. To reduce the waste of excess of capacity but guarantee meeting the demand, it is important to decide which level of capacity should be acquired and how many units of the item should be produced for every period in the planning horizon. Capacity adjustment cost incurs when capacity acquired in the current period differs from the one acquired in the previous period. Capacity acquisition costs, capacity adjustment costs, and production costs in each period are all time-varying and depend on the capacity level acquired in that period. Backlogging is allowed. Both production costs and inventory costs are assumed to be general concave. We provide optimal properties and develop an efficient exact algorithm for the general model. For the special cases with zero capacity adjustment costs or fixed-plus-linear production costs, we present a faster exact algorithm. Computational experiments show that our algorithm is able to solve medium-size instances for the general model in a few seconds, and that cost can be reduced significantly through flexible capacity adjustment.

[1]  Christophe Rapine,et al.  Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost , 2012, Oper. Res. Lett..

[2]  Christophe Rapine,et al.  Lot sizing problem with multi-mode replenishment and batch delivery , 2017 .

[3]  Chung-Lun Li,et al.  Dynamic Lot Sizing with Batch Ordering and Truckload Discounts , 2004, Oper. Res..

[4]  Alper Atamtürk,et al.  Capacity Acquisition, Subcontracting, and Lot Sizing , 2001, Manag. Sci..

[5]  H. Romeijn,et al.  Integrated capacity, demand, and production planning with subcontracting and overtime options , 2007 .

[6]  Mathieu Van Vyve Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size , 2007, Math. Oper. Res..

[7]  Luca Bertazzi,et al.  Polynomial cases of the economic lot sizing problem with cost discounts , 2014, Eur. J. Oper. Res..

[8]  J. K. Lenstra,et al.  Deterministic Production Planning: Algorithms and Complexity , 1980 .

[9]  Jinwen Ou A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs , 2017, Oper. Res. Lett..

[10]  Jan A. Van Mieghem,et al.  Commissioned Paper: Capacity Management, Investment, and Hedging: Review and Recent Developments , 2003, Manuf. Serv. Oper. Manag..

[11]  Hongyan Li,et al.  Capacitated dynamic lot sizing with capacity acquisition , 2011 .

[12]  J. Michael Harrison,et al.  Multi-Resource Investment Strategies: Operational Hedging Under Demand Uncertainty , 1997, Eur. J. Oper. Res..

[13]  Bernard Penz,et al.  A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs , 2012, Eur. J. Oper. Res..

[14]  D. Simchi-Levi,et al.  Pricing and Inventory Management , 2012 .

[15]  Zeger Degraeve,et al.  Modeling industrial lot sizing problems: a review , 2008 .

[16]  Nathalie Sauer,et al.  NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract , 2017, Eur. J. Oper. Res..

[17]  Hark-Chin Hwang,et al.  Economic Lot-Sizing for Integrated Production and Transportation , 2010, Oper. Res..

[18]  Hande Yaman,et al.  Lot Sizing with Piecewise Concave Production Costs , 2014, INFORMS J. Comput..

[19]  Knut Richter,et al.  An O(T3) algorithm for the capacitated lot sizing problem with minimum order quantities , 2011, Eur. J. Oper. Res..

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

[21]  Paul H. Zipkin,et al.  A dynamic lot-size model with make-or-buy decisions , 1989 .

[22]  Dong X. Shaw,et al.  An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs , 1998 .

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

[24]  Fernando S. Oliveira,et al.  Capacity expansion under uncertainty in an oligopoly using indirect reinforcement-learning , 2018, Eur. J. Oper. Res..

[25]  Lap Mui Ann Chan,et al.  On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures , 2002, Oper. Res..

[26]  Bernard Penz,et al.  Capacity acquisition for the single-item lot sizing problem under energy constraints , 2016, Omega.

[27]  Xi Li,et al.  Economic lot sizing: The capacity reservation model , 2013, Oper. Res. Lett..

[28]  Evan L. Porteus,et al.  Simultaneous Capacity and Production Management of Short-Life-Cycle, Produce-to-Stock Goods Under Stochastic Demand , 2002, Manag. Sci..

[29]  Hark-Chin Hwang,et al.  Two-phase algorithm for the lot-sizing problem with backlogging for stepwise transportation cost without speculative motives , 2016 .

[30]  Yves Pochet,et al.  Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs , 2009, Eur. J. Oper. Res..

[31]  Linda van Norden,et al.  Multi-product lot-sizing with a transportation capacity reservation contract , 2005, Eur. J. Oper. Res..

[32]  Jinwen Ou Economic lot sizing with constant capacities and concave inventory costs , 2012 .

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

[34]  Nils Rudi,et al.  Newsvendor Networks: Inventory Management and Capacity Investment with Discretionary Activities , 2002, Manuf. Serv. Oper. Manag..

[35]  Christophe Rapine,et al.  The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases , 2013, Eur. J. Oper. Res..

[36]  Stéphane Dauzère-Pérès,et al.  Single-item dynamic lot-sizing problems: An updated survey , 2017, Eur. J. Oper. Res..

[37]  Jinwen Ou Improved exact algorithms to economic lot-sizing with piecewise linear production costs , 2017, Eur. J. Oper. Res..

[38]  Chung-Lun Li,et al.  Dynamic lot sizing with all‐units discount and resales , 2012 .

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