An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
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.
Volume (Year): 24 (1978)
Issue (Month): 16 (December)
|Contact details of provider:|| Postal: |
Web page: http://www.informs.org/Email:
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:24:y:1978:i:16:p:1710-1720. 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.