Dynamische Bestellmengen- und Losgrößenplanung. Verfahrensübersicht und Vergleich (Q1093515)

Recent research on single-item dynamic lot sizing produced a number of different heuristic approaches to the problem. This paper compares their formal structures and reports on the results of extensive numerical tests. It is suggested that (1) the heuristics most frequently implemented in commercial software packages are inefficient by today's standards, (2) Groff's stopping rule [see \textit{G. K. Groff}, Prod. and Invent. Management 20, 47-53 (1979)] should be used when demand is fairly regular, and (3) an algorithm proposed by the authors prevails under conditions of erratic demand.