Deterministic Production Planning: Algorithms and Complexity

A class of production planning problems is considered in which known demands have to be satisfied over a finite horizon at minimum total costs. For each period, production and storage cost functions are specified. The production costs may include set-up costs and the production levels may he subject to capacity limits. The computational complexity of the problems in this class is investigated. Several algorithms proposed for their solution are described and analyzed. It is also shown that some special cases are NP-hard and hence unlikely to be solvable in polynomial time.

[1]  Selmer M. Johnson,et al.  Sequential Production Planning Over Time at Minimum Cost , 1957 .

[2]  Stuart E. Dreyfus,et al.  Applied Dynamic Programming , 1965 .

[3]  A. F. Veinott.  Production Planning with Convex Costs: A Parametric Study , 1964 .

[4]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics - Journal Canadien de Mathematiques.

[5]  W. Zangwill.  A Deterministic Multi-Period Production Scheduling Model with Backlogging , 1966 .

[6]  T. C. Hu.  Minimum‐cost flows in convex‐cost networks , 1966 .

[7]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

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

[9]  Stephen F. Love.  Bounded Production and Inventory Models with Piecewise Concave Costs , 1973 .

[10]  Richard M. Karp,et al.  On the Computational Complexity of Combinatorial Problems , 1975, Networks.

[11]  Robert R. Meyer,et al.  A Class of Nonlinear Integer Programs Solvable by a Single Linear Program , 1977 .

[12]  J. K. Lenstra,et al.  Computational complexity of discrete optimization problems , 1977 .

[13]  S. Martello,et al.  An upper bound for the zero-one knapsack problem and a branch and bound algorithm , 1977 .

[14]  M. Lambrecht,et al.  A capacity constrained single-facility dynamic lot-size model , 1978 .

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

[16]  K. R. Baker,et al.  An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints , 1978 .

[17]  David S. Johnson,et al.  `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.

[18]  E. Denardo,et al.  Shortest-Route Methods: 1. Reaching, Pruning, and Buckets , 1979, Oper. Res..

[19]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .