Abstract
The Wagner-Whitin algorithm is a well-known optimal procedure for determining production quantities X t , over the planning horizon ( N periods) when demands D t , setup cost S t , production costs C t and holding costs H t are known. Evans [1] presented a computer code and showed that W-W algorithm takes only a few seconds on the computer even for a large problem. We modify Evans code by incorporating Wagner's setup cost horizon theorem and show empirically that the new code is faster by a factor of N/4 in the best case, but is slower only by 1–2% in the worst case.
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.
