Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size

The main result of this paper is an O(n3) algorithm for the single-item lot-sizing problem with constant batch size and backlogging. We consider a general number of installable batches, i.e., in each time period t we may produce up to mt batches, where the mt are given and time-dependent. This generalizes earlier results as we consider backlogging and a general number of maximum batches. We also give faster algorithms for three special cases of this general problem. When backlogging is not allowed and the costs satisfy the Wagner-Whitin property, the problem is solvable in O(n2 log n) time. When the production in each period is required to be either zero or equal to the installed capacity, it is possible to solve the problem with and without backlogging in O(n2) and O(n log n) time, respectively.

[1]  Chung-Yee Lee.  A solution to the multiple set-up problem with dynamic demand , 1989 .

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

[3]  Leon S. Lasdon,et al.  An Efficient Algorithm for Multi-Item Scheduling , 1971, Oper. Res..

[4]  Stan P. M. van Hoesel,et al.  On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs , 1997, Oper. Res. Lett..

[5]  S. Lippman.  Optimal inventory policy with multiple set-up costs , 1968 .

[6]  van Ca Cleola Eijl.  A polyhedral approach to the discrete lot-sizing and scheduling problem , 1996 .

[7]  Chung-Yee Lee,et al.  A Dynamic Model for Inventory Lot Sizing and Outbound Shipment Scheduling at a Third-Party Warehouse , 2003, Oper. Res..

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

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

[10]  Laurence A. Wolsey,et al.  Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems , 2003, Oper. Res..

[11]  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..

[12]  Marc Salomon,et al.  The Single-Item Discrete Lotsizing and Scheduling Problem: Optimization by Linear and Dynamic Programming , 1994, Discret. Appl. Math..

[13]  Albert P. M. Wagelmans,et al.  Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems , 2001, Math. Oper. Res..

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

[15]  W. Zangwill.  Minimum Concave Cost Flows in Certain Networks , 1968 .

[16]  A. Federgruen,et al.  A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0n log n or 0n Time , 1991 .

[17]  Mathieu Van Vyve.  The Continuous Mixing Polyhedron , 2005, Math. Oper. Res..

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

[19]  Albert P. M. Wagelmans,et al.  Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case , 1992, Oper. Res..

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

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

[22]  Apm Wagelmans,et al.  Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions , 1994 .

[23]  Osman Alp,et al.  Optimal Lot-Sizing/Vehicle-Dispatching Policies Under Stochastic Lead Times and Stepwise Fixed Costs , 2003, Oper. Res..

[24]  B. Fleischmann.  The discrete lot-sizing and scheduling problem with sequence-dependent setup costs , 1994 .

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

[26]  Mathieu Van Vyve,et al.  Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity , 2006, Math. Program..

[27]  Laurence A. Wolsey,et al.  Lot-Sizing with Constant Batches: Formulation and Valid Inequalities , 1993, Math. Oper. Res..