Abstract
We present a fully polynomial time approximation scheme (FPTAS) for a capacitated economic lot-sizing problem with a monotone cost structure. An FPTAS delivers a solution with a given relative error ɛ in time polynomial in the problem size and in 1/ɛ. Such a scheme was developed by van Hoesel and Wagelmans [8] for a capacitated economic lot-sizing problem with monotone concave (convex) production and backlogging cost functions. We omit concavity and convexity restrictions. Furthermore, we take advantage of a straightforward dynamic programming algorithm applied to a rounded problem.
Similar content being viewed by others
References
Axäter, S.: Performance bounds for lot sizing heuristics. Management Sci. 5, 634–640 (1985)
Bitran, G.R., Magnanti, T.L., Yanasse, H.H.: Approximation methods for the uncapacitated dynamic lot size problem. Management Sci. 9, 1121–1140 (1984)
Bitran, G.B., Matsuo, H.: Approxomation formulations for the single-product capacitated lot size problem. Oper. Res. 34, 63–74 (1986)
Bitran, G.B., Yanasse, H.H.: Computational complexity of the capacitated lot size problem. Management Sci. 28, 1174–1186 (1982)
Florian, M., Lenstra, J.K., Rinnooy Kan, A.H.G.: Deterministic production planning: algorithms and complexity. Management Sci. 26, 669–679 (1980)
Kovalyov, M.Y.: Improving the complexities of approximation algorithms for optimization problems. Oper. Res. Lett. 17, 85–87 (1995)
Tanaev, V.S., Kovalyov, M.Y., Shafransky, Y.M.: Scheduling theory. Group technologies. Minsk, IEC NANB, (In Russian), 1998, pp. 41–44
Van Hoesel, C.P.M., Wagelmans, A.P.M.: Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems. Math. Oper. Res. 26, 339–357 (2001)
Woeginger, G.J.: When does a dynamic programming formulation guarantee the existence of an FPTAS? J. Comput. 12, 57–74 (2000)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chubanov, S., Kovalyov, M. & Pesch, E. An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure. Math. Program. 106, 453–466 (2006). https://doi.org/10.1007/s10107-005-0641-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-005-0641-0