A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
Mathematics of Operations Research
NP hard cases of the single item capacitated lot sizing problem have been the topic of extensive research and continue to receive considerable attention. However, surprisingly few theoretical results have been published on approximation methods for these problems. To the best of our knowledge, until now no polynomial approximation method is known which produces solutions with a relative deviation from optimality that is bounded by a constant. In this paper we show that such methods do exist, bydoi:10.1287/moor.26.2.339.10552 fatcat:z3tss2uzcbdnthmp274lvefalq