Please use this identifier to cite or link to this item:
|Title:||Two-way eyeballing heuristics in dynamic lot sizing with backlogging|
|Citation:||Choo, E.U.,Chan, G.H. (1990). Two-way eyeballing heuristics in dynamic lot sizing with backlogging. Computers and Operations Research 17 (4) : 359-363. ScholarBank@NUS Repository.|
|Abstract:||A simple class of heuristic algorithms for discrete dynamic lot size problems with backlogging is presented which can be easily implemented by eyeballing comparisons of the demand sequence with a fixed two sided sequence of cut-off values. Encouraging computational results of two specific interesting cases of such heuristics are reported. Other two-way heuristics are suggested. © 1990.|
|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 Nov 16, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.