| Article ID: | iaor19981555 |
| Country: | United Kingdom |
| Volume: | 24 |
| Issue: | 11 |
| Start Page Number: | 1075 |
| End Page Number: | 1083 |
| Publication Date: | Nov 1997 |
| Journal: | Computers and Operations Research |
| Authors: | Hariga Moncer, Al-Alyan Ali |
| Keywords: | heuristics |
In this article, we consider the inventory replenishment problem with shortages over a fixed time horizon for a product deteriorating at a constant rate. We do not put restrictions on the length of the replenishment cycles and the form of the demand function, making our model a general one. For linearly and exponentially time varying demands, the results of a comparative work show that our heuristic is economically and computationally more efficient than the equal cycle approach.