A NOTE ON DYNAMIC LOT SIZING IN A ROLLING‐HORIZON ENVIRONMENT
修改了Wagner-Whitin动态批量算法以适应滚动计划环境，计算表明改进算法比原算法和Silver-Meal启发式方法成本更低，且额外计算量很小。
ABSTRACT 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.