Abstract
In this paper, we consider the lot-sizing problem in a periodic-review inventory system under non-stationary stochastic demand. We propose a heuristic and compare its performance with the optimal solution given by dynamic programming for 90 problem instances. Across all the problem instances the heuristic averages 1.96% error, and is found to be at least 30 times faster than dynamic programming.
Sign-in/Register to access full text options 
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.
