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

被引:0
作者
Sergei Chubanov
Mikhail Y. Kovalyov
Erwin Pesch
机构
[1] Belarus State University and the Institute of Information Systems at the University of Siegen,Faculty of Economics
[2] Belarus State University,Faculty of Economics
[3] and United Institute of Informatics Problems,Institute of Information Systems at the University of Siegen
[4] National Academy of Sciences of Belarus,undefined
[5]  ,undefined
来源
Mathematical Programming | 2006年 / 106卷
关键词
Capacitated economic lot-sizing problem; Dynamic programming; Fully polynomial time approximation scheme;
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
页码:453 / 466
页数:13
相关论文
共 35 条