We have developed an improved implementation of the Wagner‐Whitin algorithm for economic lot‐sizing problems based on the planning‐horizon theorem and the Economic‐Part‐Period concept. For many rigorous test conditions, this algorithm is about twice as fast and requires only half the array storage capacity of the previously fastest algorithm. Its execution time is approximately linear in the number of periods in the planning‐horizon.
ColemanB. J. and McKnewM. A. (1991), “An Improved Heuristic for Multilevel Lot Sizing in Material Requirements Planning,”Decision Sciences, 22, 1, 136–156.
2.
EvansJ. R. (1985), “An Efficient Implementation of the Wagner‐Whitin Algorithm for Dynamic Lot‐Sizing,”Journal of Operations Management, 5, 2, 239–235.
3.
EvansJ. R.SaydamC., and McKnewM. (1989), “A Note on Solving the Concave Cost Dynamic Lot‐Sizing Problem in Almost Linear Time,”Journal of Operations Management, 8, 2, 159–167.
4.
JacobsF. R. and KhumawalaB. (1987), “A Simplified Procedure for Optimal Single‐Level Lot Sizing,”Production and Inventory Management, 28, 3, 39–43.
5.
SaydamC. and McKnewM. (1987), “A Fast Microcomputer Program for Ordering Using the Wagner‐Whitin Algorithm,”Production and Inventory Management Journal, 28, 4, 15–19.
6.
VeralE. A. and LaForgeR. L. (1985), “The Performance of a Simple Incremental Lot‐Sizing Rule in a Multilevel Inventory Environment,”Decision Sciences, 16, 1, 57–72.
7.
WagnerH. M. and WhitinT. M. (1958), “Dynamic Version of the Economic Lot Size Model,”Management Science, 5, 1, 89–96.
