| Article ID: | iaor19881017 |
| Country: | United Kingdom |
| Volume: | 16 |
| Start Page Number: | 189 |
| End Page Number: | 193 |
| Publication Date: | Jun 1989 |
| Journal: | Computers and Operations Research |
| Authors: | Choo Eng Ung, Chan Gin Hor |
| Keywords: | production, heuristics |
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.