Lot-sizing with non-stationary cumulative capacities

We study a new class of capacitated economic lot-sizing problems. We show that the problem is NP-hard in general and derive a fully polynomial-time approximation algorithm under mild conditions on the cost functions. Furthermore, we develop a polynomial-time algorithm for the case where all cost functions are concave.

[1]  W. Zangwill.  A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System---A Network Approach , 1969 .

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

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

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Mikhail Y. Kovalyov,et al.  An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure , 2006, Math. Program..

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

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

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

[9]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[10]  Philip M. Kaminsky,et al.  Production and Distribution Lot Sizing in a Two Stage Supply Chain , 2003 .

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

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

[14]  Albert P. M. Wagelmans,et al.  Integrated Lot Sizing in Serial Supply Chains with Production Capacities , 2005, Manag. Sci..

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

[16]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .