Please use this identifier to cite or link to this item:
|Title:||Eyeballing heuristics for dynamic lot sizing problems with rolling horizons|
|Citation:||Chan, G.H. (1997-04). Eyeballing heuristics for dynamic lot sizing problems with rolling horizons. Computers and Operations Research 24 (4) : 379-385. ScholarBank@NUS Repository.|
|Abstract:||The dynamic lot sizing problem with rolling horizons was found to be a difficult problem for getting efficient solutions. The existing algorithms do not perform well for short forecast windows because of uncertain demands beyond the forecast windows. The one-way eyeballing heuristics is introduced to solve the problem. It determines the production cycle if the eyeballing comparison ends before a forecast window, otherwise, it generates a safety stock to satisfy some demands after the forecast window. The computational results on uniform and normal demand patterns show a big improvement in costs for problems with short forecast windows. We have also applied the heuristics to dynamic lot sizing problems with variable forecast windows and also obtained good computational results. © 1997 Elsevier Science Ltd. All rights reserved.|
|Source Title:||Computers and Operations Research|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 28, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.