| Article ID: | iaor20083559 |
| Country: | United Kingdom |
| Volume: | 17 |
| Issue: | 4 |
| Start Page Number: | 359 |
| End Page Number: | 363 |
| Publication Date: | Jun 1990 |
| Journal: | Computers and Operations Research |
| Authors: | Choo Eng Ung, Chan Gin Hor |
| Keywords: | heuristics |
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.