Column generation approach for solving uncapacitated dynamic lot-sizing problems with time-varying cost

Warut Boonphakdee and Peerayuth Charnsethikul

International Journal of Mathematics in Operational Research, 2022, vol. 23, issue 1, 55-75

Abstract: This study proposes the column generation approach for generating the uncapacitated dynamic lot-sizing problem solution under time-varying cost. The dynamic programming approach is also applied to calculate the cost function value. However, this column generation approach generates only an optimal lot size at period 1. Therefore, using the consistent arc method, search the connecting arc from period 1 to period N. Comparing the lot sizes generated by the proposed and the dynamic programming methods, they are the same value. Therefore, they are an optimal solution. Using GUROBI's simplex method can enhance to reduce the running time on dense matrices to be less than the original simplex method, about 25.4% and 26.1% for 12 and 24 periods. The lowest raw material fluctuation price period is selected obviously to order so that the total inventory cost will still be minimal. Therefore, the raw material price significantly influences procurement decision-making.

Keywords: dynamic programming; network inventory; column generation; maximum problem size. (search for similar items in EconPapers)
Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=126051 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:23:y:2022:i:1:p:55-75

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().