Computational Complexity of the Capacitated Lot Size Problem

Gabriel R. Bitran and Horacio H. Yanasse
Additional contact information
Gabriel R. Bitran: Massachusetts Institute of Technology
Horacio H. Yanasse: Institute Nacional de Pesquisas Espaciais, Brazil

Management Science, 1982, vol. 28, issue 10, 1174-1186

Abstract: In this paper we study the computational complexity of the capacitated lot size problem with a particular cost structure that is likely to be used in practical settings. For the single item case new properties are introduced, classes of problems solvable by polynomial time algorithms are identified, and efficient solution procedures are given. We show that special classes are NP-hard, and that the problem with two items and independent setups is NP-hard under conditions similar to those where the single item problem is easy. Topics for further research are discussed in the last section.

Keywords: inventory/production:; capacitated; lot; sizing (search for similar items in EconPapers)
Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (124)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.28.10.1174 (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:28:y:1982:i:10:p:1174-1186

Access Statistics for this article

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