An efficient procedure for dynamic lot-sizing model with demand time windows

0.00 Avg rating—0 Votes

Article ID:	iaor20072177
Country:	Netherlands
Volume:	37
Issue:	1
Start Page Number:	11
End Page Number:	26
Publication Date:	Jan 2007
Journal:	Journal of Global Optimization
Authors:	Hwang Hark-Chin
Keywords:	programming: dynamic, production

Abstract:

We consider a dynamic lot-sizing model with demand time windows where n demands need to be scheduled in T production periods. For the case of backlogging allowed, an O(T³) algorithm exists under the non-speculative cost structure. For the same model with somewhat general cost structure, we propose an efficient algorithm with O(max {T², nT}) time complexity.

Reviews

Required fields are marked *. Your email address will not be published.