Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5179| Title: | Analysis of the Uncapacitated Dynamic Lot Size Problem |
| Issue Date: | 9-Oct-2013 |
| Publisher: | Massachusetts Institute of Technology, Operations Research Center |
| Description: | In this paper we provide worst case error bounds for several heuristics for the uncapacitated dynamic lot size problem. We propose two managerially oriented procedures and show that they have a relative worst case error bound equal to two, and develop similar analyses for methods known as the "Silver and Meal" heuristics, the part period balancing heuristics, and economic order quantity heuristics (expressed in terms of a time supply of demand).We also present results on aggregation and partitioning of the planning horizon. |
| URI: | http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
| Other Identifiers: | http://hdl.handle.net/1721.1/5179 |
| Appears in Collections: | MIT Items |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.