Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5178| Title: | Approximation Formulations for the Single Product Capacitated Lot Size Problem |
| Issue Date: | 9-Oct-2013 |
| Publisher: | Massachusetts Institute of Technology, Operations Research Center |
| Description: | We consider two approximation formulations for the single product capacitated lot size problem. They correspond respectively to a restriction of the number of production policies and to the rounding of demands up to multiples of a constant. After briefly reviewing the literature within a new % ~ framework, we discuss the relations between these approximation formulations. Next, we provide relative error bounds and algorithms for solving the approximation problems. We demonstrate that these approximation formulations require a significantly smaller number of calculations than the original formulation, and that the relative error bounds are satisfactory for practical purposes. |
| URI: | http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
| Other Identifiers: | http://hdl.handle.net/1721.1/5178 |
| 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.