Name
Abstract | ||
|---|---|---|
We develop improved algorithms for the dynamic lot sizing problems with incremental discount, where the procurement cost is a concave piecewise linear function with m sections and the holding cost is linear. We decompose the problem carefully and present a new dynamic programming formulation. By using geometric techniques, we show that when m is fixed, the problem can be solved in O(T log T) time, and further O(T) time if the procurement cost is stationary. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1080/10556788.2017.1368508 | OPTIMIZATION METHODS & SOFTWARE |
Keywords | Field | DocType |
dynamic lot sizing,concave piecewise linear cost,exact algorithms,geometric technique,dynamic programming | Dynamic programming,Mathematical optimization,Holding cost,Algorithm,Sizing,Procurement,Piecewise linear function,Mathematics | Journal |
Volume | Issue | ISSN |
34 | 1 | 1055-6788 |
Citations | PageRank | References |
0 | 0.34 | 15 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jie Fan | 1 | 0 | 0.68 |
| Guoqing Wang | 2 | 75 | 17.84 |