| dc.creator |
Britan, Gabriel R. |
|
| dc.creator |
Matsuo, Hirofumi |
|
| dc.date |
2004-05-28T19:26:39Z |
|
| dc.date |
2004-05-28T19:26:39Z |
|
| dc.date |
1983-03 |
|
| dc.date.accessioned |
2013-10-09T02:38:08Z |
|
| dc.date.available |
2013-10-09T02:38:08Z |
|
| dc.date.issued |
2013-10-09 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/5178 |
|
| dc.identifier.uri |
http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
|
| dc.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. |
|
| dc.format |
1541016 bytes |
|
| dc.format |
application/pdf |
|
| dc.language |
en_US |
|
| dc.publisher |
Massachusetts Institute of Technology, Operations Research Center |
|
| dc.relation |
Operations Research Center Working Paper;OR 120-83 |
|
| dc.title |
Approximation Formulations for the Single Product Capacitated Lot Size Problem |
|
| dc.type |
Working Paper |
|