Premium
Dynamic lot sizing techniques: Survey and comparison
Author(s) -
Zoller Klaus,
Robrade Andreas
Publication year - 1988
Publication title -
journal of operations management
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.649
H-Index - 191
eISSN - 1873-1317
pISSN - 0272-6963
DOI - 10.1016/0272-6963(81)90009-7
Subject(s) - heuristics , sizing , computer science , heuristic , operations research , software , risk analysis (engineering) , mathematical optimization , industrial engineering , artificial intelligence , mathematics , engineering , business , art , visual arts , programming language , operating system
Numerous heuristics have been proposed in the past two decades for the dynamic lot sizing problem, many of them in APICS journals. Their relative performance is explored in extensive numerical tests measuring expected costs, risks of higher than expected costs and computer time consumed. The results indicate that users of pertinent standard software systems could benefit substantially from an incorporation of more recently proposed methods, specifically Groff's (1979) stop rule and a fathoming algorithm expanding it to a look‐ahead heuristic.