Lot Sizing Heuristics Performance

Each productive system manager knows that finding the optimal trade‐off between reducing inventory and decreasing the frequency of production/replenishment orders allows a great cut‐back in operations costs. Several authors have focused their contributions, trying to demonstrate that among the various dynamic lot sizing rules there are big differences in terms of performance, and that these differences are not negligible. In this work, eight of the best known lot sizing algorithms have been described with a unique modelling approach and have then been exhaustively tested on several different scenarios, benchmarking versus Wagner and Whitin’s optimal solution. As distinct from the contributions in the literature, the operational behaviour has been evaluated in order to determine which one is more suitable to the characteristics of each scenario.