Expected performance of two lot-sizing heuristics in a finite planning horizon

In this paper the authors study the expected performance of two dynamic lot-sizing heuristics, Part-Period-Balancing and Silver-Meal, in a finite planning horizon. Some recursive equations for computing the expected value of the heuristic solutions have been derived and illustrated by examples. The authors also conduct a comparative study on the expected performance of two heuiristics for uniformly distributed demands and provide some guidelines for selecting the two heuristics.