Skip to main content
SpringerLink
Log in

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

  • Published:
Mathematical Programming Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Axäter, S.: Performance bounds for lot sizing heuristics. Management Sci. 5, 634–640 (1985)

    Google Scholar 

  2. Bitran, G.R., Magnanti, T.L., Yanasse, H.H.: Approximation methods for the uncapacitated dynamic lot size problem. Management Sci. 9, 1121–1140 (1984)

    MathSciNet  Google Scholar 

  3. Bitran, G.B., Matsuo, H.: Approxomation formulations for the single-product capacitated lot size problem. Oper. Res. 34, 63–74 (1986)

    MATH  MathSciNet  Google Scholar 

  4. Bitran, G.B., Yanasse, H.H.: Computational complexity of the capacitated lot size problem. Management Sci. 28, 1174–1186 (1982)

    MATH  MathSciNet  Google Scholar 

  5. Florian, M., Lenstra, J.K., Rinnooy Kan, A.H.G.: Deterministic production planning: algorithms and complexity. Management Sci. 26, 669–679 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kovalyov, M.Y.: Improving the complexities of approximation algorithms for optimization problems. Oper. Res. Lett. 17, 85–87 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  7. Tanaev, V.S., Kovalyov, M.Y., Shafransky, Y.M.: Scheduling theory. Group technologies. Minsk, IEC NANB, (In Russian), 1998, pp. 41–44

  8. 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)

    Article  MATH  MathSciNet  Google Scholar 

  9. Woeginger, G.J.: When does a dynamic programming formulation guarantee the existence of an FPTAS? J. Comput. 12, 57–74 (2000)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Economics, Belarus State University and the Institute of Information Systems at the University of Siegen, Germany

    Sergei Chubanov

  2. Faculty of Economics, Belarus State University, and United Institute of Informatics Problems, National Academy of Sciences of Belarus, Skorini 4, 220050, Minsk, Belarus

    Mikhail Y. Kovalyov

  3. Institute of Information Systems at the University of Siegen,  , Germany

    Erwin Pesch

Authors
  1. Sergei Chubanov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mikhail Y. Kovalyov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Erwin Pesch
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sergei Chubanov.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-005-0641-0

Keywords

Search

Navigation