A Dynamic Programming Approach to a Lot Size Scheduling Problem
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.
Volume (Year): 12 (1966)
Issue (Month): 11 (July)
|Contact details of provider:|| Postal: |
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:12:y:1966:i:11:p:778-784. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.