Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1143101 | Operations Research Letters | 2007 | 9 Pages |
Abstract
We study a new class of capacitated economic lot-sizing problems. We show that the problem is NP-hard in general and derive a fully polynomial-time approximation algorithm under mild conditions on the cost functions. Furthermore, we develop a polynomial-time algorithm for the case where all cost functions are concave.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
F. Zeynep Sargut, H. Edwin Romeijn,