Column generation approach for solving uncapacitated dynamic lot-sizing problems with time-varying cost Online publication date: Mon, 10-Oct-2022
by Warut Boonphakdee; Peerayuth Charnsethikul
International Journal of Mathematics in Operational Research (IJMOR), Vol. 23, No. 1, 2022
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook