Lot Sizing Heuristics Performance
Author(s) -
Luca Baciarello,
Marco D’Avino,
Riccardo Onori,
Massimiliano M. Schiraldi
Publication year - 2013
Publication title -
international journal of engineering business management
Language(s) - English
Resource type - Journals
ISSN - 1847-9790
DOI - 10.5772/56004
Subject(s) - sizing , benchmarking , heuristics , computer science , operations research , order (exchange) , production (economics) , inventory management , industrial engineering , mathematical optimization , operations management , engineering , economics , mathematics , microeconomics , art , visual arts , operating system , management , finance
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 exhaustivelytested 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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom