A further analysis of variable demand lot-sizing techniques

This study expands an earlier article by Nydick and Weiss in which ten variable demand lot-sizing techniques were compared. Two primary issues are addressed: the relative performance of a recently submitted method which was not among the ten studied previously, and the evaluation of computational times required to reach solutions. The latter point is important given the perceptions regarding the difficulty of the Wagner-Whitin algorithm, a matter which has been largely addressed by fast Turbo Pascal code and computer hardware.