Algorithms for single item constant capacity lotsizing problems

The main result of this paper is to provide an O(n3) algorithm for the single item constant capacity lotsizing problem with backlogging and a general number of installable batches, i.e in each time period t we may install up to mt multiples of the batch capacity, where the mt are given and are time-dependent. This generalizes earlier results [12, 16] as we consider backlogging and a general number of installable 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(n2logn) time. In the discrete case it is possible to solve the problem with and without backlogging in O(n2) and O(n2logn) time respectively.

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

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

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

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

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

[6]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

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

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

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

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

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

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

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

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

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

[16]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

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

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