Abstract
Abstract Dynamic lot sizing heuristics commonly implemented in standard MRP software perform well under conditions of systematic demand only. A survey and numerical test of methods proposed in the literature shows that techniques are available which cope efficiently with both systematic and erratic demand. The paper discusses theoretical and practical ramifications of the dynamic lot sizing problem, surveys heuristics published in the U.S. and West German literature, reports summarily on the findings of extensive simulation experiments involving these heuristics, and, as a conclusion from analytical and numerical results, proposes an algorithm which enhances performance under conditions of erratic demand.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
