A fast heuristic for minimising total average cycle stock subject to practical constraints

We address a problem of setting reorder intervals (time supplies) of a popu lation of items, subject to a restricted set of possible intervals as well as a limit on the total number of replenishments per unit time, both import ant practical constraints. We provide a dynamic programming formulation for obtaining the optimal solution. In addition, a simple and efficient heuris tic algorithm has been developed. Computational experiments show that the p erformance of the heuristic is excellent based on a set of realistic exampl es.