Deterministic Production Planning: Algorithms and Complexity

M. Florian, J. K. Lenstra and A. H. G. Rinnooy Kan
Additional contact information
M. Florian: Université de Montréal
J. K. Lenstra: Mathematisch Centrum, Amsterdam
A. H. G. Rinnooy Kan: Erasmus University, Rotterdam

Management Science, 1980, vol. 26, issue 7, 669-679

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.

Keywords: inventory/production: deterministic models; inventory/production: surveys; dynamic programming: deterministic; discrete time (search for similar items in EconPapers)
Date: 1980
References: Add references at CitEc
Citations: View citations in EconPapers (133)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.26.7.669 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:26:y:1980:i:7:p:669-679

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().