| Article ID: | iaor1990531 |
| Country: | United Kingdom |
| Volume: | 17 |
| Start Page Number: | 1 |
| End Page Number: | 7 |
| Publication Date: | May 1990 |
| Journal: | Computers and Operations Research |
| Authors: | Choo E.U., Chan G.H. |
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.