Mathematical Programming

, Volume 106, Issue 3, pp 453–466

An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure

  • Sergei Chubanov
  • Mikhail Y. Kovalyov
  • Erwin Pesch
Article

DOI: 10.1007/s10107-005-0641-0

Cite this article as:
Chubanov, S., Kovalyov, M. & Pesch, E. Math. Program. (2006) 106: 453. doi:10.1007/s10107-005-0641-0

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.

Keywords

Capacitated economic lot-sizing problemDynamic programmingFully polynomial time approximation scheme

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Sergei Chubanov
    • 1
  • Mikhail Y. Kovalyov
    • 2
  • Erwin Pesch
    • 3
  1. 1.Faculty of EconomicsBelarus State University and the Institute of Information Systems at the University of SiegenGermany
  2. 2.Faculty of EconomicsBelarus State University, and United Institute of Informatics Problems, National Academy of Sciences of BelarusMinskBelarus
  3. 3.Institute of Information Systems at the University of Siegen Germany