An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
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 [varepsilon] in time polynomial in the problem size and in 1/[varepsilon]. Such a scheme was develope...
Gespeichert in:
Veröffentlicht in: | Mathematical programming 2006-07, Vol.106 (3), p.453-466 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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 [varepsilon] in time polynomial in the problem size and in 1/[varepsilon]. 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. [PUBLICATION ABSTRACT] |
---|---|
ISSN: | 0025-5610 1436-4646 |
DOI: | 10.1007/s10107-005-0641-0 |