Article ID: | iaor20083403 |
Country: | Netherlands |
Volume: | 35 |
Issue: | 4 |
Start Page Number: | 549 |
End Page Number: | 557 |
Publication Date: | Jul 2007 |
Journal: | Operations Research Letters |
Authors: | Romeijn H. Edwin, Sargut F. Zeynep |
Keywords: | inventory |
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.