A Dynamic Programming Approach to a Lot Size Scheduling Problem

Earl E. Bomberger
Additional contact information
Earl E. Bomberger: The Budd Company, Philadelphia

Management Science, 1966, vol. 12, issue 11, 778-784

Abstract: The problem considered is that of scheduling the production of several different items over the same facility on a repetitive basis. The facility is such that only one item can be produced at a time; there is a setup cost and a setup time associated with producing each item; the demand rate for each item is known and constant over an infinite planning horizon, and all demand must be met. A dynamic programming solution is developed. This solution is applied to a sample problem, and the results are compared with pertinent bounds.

Date: 1966
References: Add references at CitEc
Citations: View citations in EconPapers (35)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.12.11.778 (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:12:y:1966:i:11:p:778-784

Access Statistics for this article

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