An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints

Kenneth R. Baker, Paul Dixon, Michael J. Magazine and Edward A. Silver
Additional contact information
Kenneth R. Baker: Duke University
Paul Dixon: University of Waterloo
Michael J. Magazine: University of Waterloo
Edward A. Silver: University of Waterloo

Management Science, 1978, vol. 24, issue 16, 1710-1720

Abstract: We consider the situation of a single item having a deterministic, time-varying demand pattern. Production lot sizes, so as to minimize the total of setup and carrying costs, are to be determined subject to production capacity restrictions that can vary with time. Two important theorems concerning properties of the optimal solution are exploited in developing a tree search algorithm. In addition, other properties are utilized to reduce the amount of search necessary. Results of extensive tests are presented and discussed.

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

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.24.16.1710 (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:24:y:1978:i:16:p:1710-1720

Access Statistics for this article

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