Article ID: | iaor20043428 |
Country: | Netherlands |
Volume: | 28 |
Issue: | 3 |
Start Page Number: | 311 |
End Page Number: | 323 |
Publication Date: | Sep 2004 |
Journal: | Computational Optimization and Applications |
Authors: | Sicilia Joaqun, Sedeo-Noda A., Gutirrez J., Abdul-Jalbar B. |
Keywords: | lot sizing |
In this paper the dynamic lot size problem with time varying storage capacities and linear costs is addressed. Like in the uncapacitated version, this problem can be formulated as a network flow problem. Considering the properties of the underlying network, we devise an