TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time

References

• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms, and Applications (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Bitran G. R., Yanasse H. H. Computational complexity of the capacitated lot size problem. Management Sci. (1982) 28:1174–1186Link, Google Scholar
• Cormen T. H., Leiserson C. E., Rivest R. L., Stein C.Introduction to Algorithms (2001) 2nd ed.(MIT Press, Cambridge, MA) Google Scholar
• Federgruen A., Meissner J., Tzur M. Progressive integral heuristics for multi-item capacitated lot-sizing problems. Oper. Res. (2007) 55(3):490–502Link, Google Scholar
• Florian M., Lenstra J. K., Rinnooy Kan A. H. G. Deterministic production planning: Algorithms and complexity. Management Sci. (1980) 26:669–679Link, Google Scholar
• Orlin J. B. A faster strongly polynomial minimum cost flow algorithm. Oper. Res. (1993) 41:338–350Link, Google Scholar
• Sedeño-Noda A., Gutiérrez J., Abdul-Jalbar B., Sicilia J. An O(T log T) algorithm for the dynamic lot size problem with limited storage and linear costs. Computational Optim. Appl. (2004) 28:311–323Crossref, Google Scholar
• Tarjan R. E.Data Structures and Network Algorithms (1983) (SIAM, Philadelphia) Crossref, Google Scholar
• Wagner H. M., Whitin T. M. Dynamic version of the economic lot size model. Management Sci. (1958) 5:89–96Link, Google Scholar