Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case

DOI10.1287/opre.40.1.S145zbMath0771.90031MaRDI QIDQ3990573

Albert P. M. Wagelmans, Stan P. M. van Hoesel, Antoon W. J. Kolen

Publication date: 28 June 1992

Published in: Operations Research (Search for Journal in Brave)

zbMATH Keywords

\(n\)-period economic lot sizing

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90B05: Inventory, storage, reservoirs

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

A dual algorithm for the economic lot-sizing problem, Improved complexity bounds for location problems on the real line, An efficient algorithm for the dynamic economic lot size problem