Please use this identifier to cite or link to this item:
|Title:||Eyeballing heuristics for dynamic lot size problems|
|Authors:||Eng Ung Choo|
Gin Hor Chan
|Citation:||Eng Ung Choo,Gin Hor Chan (1989). Eyeballing heuristics for dynamic lot size problems. Computers and Operations Research 16 (3) : 189-193. ScholarBank@NUS Repository.|
|Abstract:||A class of simple heuristic algorithms for discrete dynamic lot size problems without backlogging is presented. The implementation of such a heuristic only involves a simple eyeballing comparison of a predetermined sequence of cut-off values with the sequence of product demands. © 1989.|
|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 Oct 5, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.