The impact of a rolling schedule in a multi‐level MRP system
比较了不同批量算法在多级滚动计划下的成本表现，发现Silver-Meal启发式在某些条件下成本低于Wagner-Whitin算法，并提出了改进成本方法。
Abstract This paper presents a cost performance comparison of different lot‐sizing algorithms under multi‐level rolling schedule conditions. Most multi‐level studies have focused on fixed horizon problems, omitting an important characteristic of an operating MRP system. The results indicate that, under certain conditions, the computationally simple Silver‐Meal heuristic provides lower lot‐sizing costs than the Wagner‐Whitin algorithm. In addition, cost modifications are introduced which greatly enhance the multi‐level performance of these single‐level lot‐sizing heuristics.