A NOTE ON DYNAMIC LOT SIZING IN A ROLLING-HORIZON ENVIRONMENT

This paper presents a modification of the dynamic lot-size algorithm of Wagner and Whitin for rolling horizon environments. The computational results show that the modified algorithm gives better cost performance than the Wagner-Whitin algorithm and the Silver-Meal heuristic. The improvements over the Wagner-Whitin algorithm require very few additional computations.