Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/informs/deterministic-production-planning-algorithms-and-complexity-YzJXe026db
References (21)
-
K. Baker, P. Dixon, M. Magazine, E. Silver (1978)
An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity ConstraintsManagement Science, 24
-
J. Lenstra, A. Kan (1977)
Computational complexity of discrete optimization problemsAnnals of discrete mathematics, 4
-
R. Karp (1972)
Reducibility Among Combinatorial Problems -
(1976)
Combinatorial optimization : networks and matroids -
E. Denardo, B. Fox (1979)
Shortest-Route Methods: 1. Reaching, Pruning, and BucketsOper. Res., 27
-
M. Garey, David Johnson (1978)
`` Strong '' NP-Completeness Results: Motivation, Examples, and ImplicationsJ. ACM, 25
-
R. Bellman, S. Dreyfus (1965)
Applied Dynamic Programming -
S. Martello, P. Toth (1977)
An upper bound for the zero-one knapsack problem and a branch and bound algorithmEuropean Journal of Operational Research, 1
-
L. Khachiyan (1980)
Polynomial algorithms in linear programmingUssr Computational Mathematics and Mathematical Physics, 20
-
W. Zangwill (1966)
A Deterministic Multi-Period Production Scheduling Model with BackloggingManagement Science, 13
-
S. Johnson (1957)
Sequential Production Planning Over Time at Minimum CostManagement Science, 3
-
M. Florian, M. Klein (1971)
DETERMINISTIC PRODUCTION PLANNING WITH CONCAVE COSTS AND CAPACITY CONSTRAINTS.Management Science, 18
-
David Johnson, W. Freeman
The Np-completeness Column: an Ongoing Guide Garey and Myself in Our Book ''computers and Intractability: a Guide to the Theory of Np-completeness,'' -
T. Hu (1966)
Minimum‐cost flows in convex‐cost networksNaval Research Logistics Quarterly, 13
-
R. Karp (1975)
On the Computational Complexity of Combinatorial ProblemsNetworks, 5
-
M. Lambrecht, J. Eecken (1978)
A capacity constrained single-facility dynamic lot-size modelEuropean Journal of Operational Research, 2
-
R. Meyer (1977)
A Class of Nonlinear Integer Programs Solvable by a Single Linear ProgramSiam Journal on Control and Optimization, 15
-
A. Veinott (1964)
Production Planning with Convex Costs: A Parametric StudyManagement Science, 10
-
Stephen Love (1973)
Bounded Production and Inventory Models with Piecewise Concave CostsManagement Science, 20
-
S. Cook (1971)
The complexity of theorem-proving proceduresProceedings of the third annual ACM symposium on Theory of computing
-
J. Edmonds (1965)
Paths, Trees, and FlowersCanadian Journal of Mathematics, 17
- Publisher
- INFORMS
- Copyright
- Copyright © INFORMS
- Subject
- Research Article
- ISSN
- 0025-1909
- eISSN
- 1526-5501
- DOI
- 10.1287/mnsc.26.7.669
- Publisher site
- See Article on Publisher Site
Abstract
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.
Journal
Management Science – INFORMS
Published: Jul 1, 1980
Keywords: Keywords : inventory/production: deterministic models ; inventory/production: surveys ; dynamic programming: deterministic, discrete time