HEURISTIC LOT‐SIZING PERFORMANCE IN A ROLLING‐SCHEDULE ENVIRONMENT*

Abstract

Abstract This paper examines the impact of a rolling‐schedule implementation on the performance of three of the better known lot‐sizing methods for single‐level assembly systems——Part‐Period‐Cost‐Balancing, Silver‐Meal, and Wagner‐Whitin algorithms—and a modified version of the Silver‐Meal procedure. The main finding is that under certain conditions the computationally simpler Silver‐Meal heuristic can provide cost performance superior to that of the Wagner‐Whitin algorithm.