| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142555 | Operations Research Letters | 2010 | 6 Pages |
Abstract
In this paper we generalize the classical dynamic lot-sizing problem by considering production capacity constraints as well as delivery and/or production time windows. Utilizing an untraditional decomposition principle, we develop a polynomial-time algorithm for computing an optimal solution for the problem under the assumption of non-speculative costs. The proposed solution methodology is based on a dynamic programming algorithm that runs in O(nT4)O(nT4) time, where nn is the number of demands and TT is the length of the planning horizon.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
H.-C. Hwang, W. Jaruphongsa, S. Çetinkaya, C.-Y. Lee,