dc.contributor.author | Britan, Gabriel R. | en_US |
dc.contributor.author | Matsuo, Hirofumi | en_US |
dc.date.accessioned | 2004-05-28T19:26:39Z | |
dc.date.available | 2004-05-28T19:26:39Z | |
dc.date.issued | 1983-03 | en_US |
dc.identifier.uri | http://hdl.handle.net/1721.1/5178 | |
dc.description.abstract | 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. | en_US |
dc.format.extent | 1541016 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | en_US | en_US |
dc.publisher | Massachusetts Institute of Technology, Operations Research Center | en_US |
dc.relation.ispartofseries | Operations Research Center Working Paper;OR 120-83 | en_US |
dc.title | Approximation Formulations for the Single Product Capacitated Lot Size Problem | en_US |
dc.type | Working Paper | en_US |