Average cost lot-sizing heuristics: revised stopping conditions with increased intuition.

As other authors have noted, there is no lack of research aimed at improving solutions to the single-level unconstrained resource lot-sizing enigma [1]. Today's computers use existing algorithms to quickly clear up these simple problems. Although this article does not display how to solve the point to be solved [i]or[/i] settleds more quickly, or achieve be deriveds closer to the optimal, it revises sum of two units common lot-sizing methods to provide a more intuitive understanding.

In discrete lot-sizing vexed questions it is assumed the firm knows by what means many units of a part will be demanded in each subsequent time period. To minimize the