An O(T log T) algorithm for the dynamic lot size problem with limited storage and linear costs

Computational Optimization and Applications

Volumn 28, Issue 3, 2004, Pages 311-323

  Sedeno Noda A ^a   Gutierrez J ^a   Abdul Jalbar, B ^a   Sicilia, J ^a  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

Capacity constraint; Inventory dynamic systems; Lot size

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COSTS; DATA STORAGE EQUIPMENT; DYNAMIC PROGRAMMING; ELECTRONIC COMMERCE; LINEAR SYSTEMS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; WAREHOUSES;

CAPACITY CONSTRAINT; INVENTORY DYNAMIC SYSTEMS; LOT SIZES; WAREHOUSE CAPACITY; ZERO SETUP COSTS;

INVENTORY CONTROL;

EID: 3142722587     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:COAP.0000033966.31088.98     Document Type: Article

References (30)

1. A. Aggarwal and J.K. Park, "Improved algorithms for economic lot size problems," Oper. Res., vol. 41, pp. 549-571, 1993.
2. R.K. Ahuja, A.V. Goldberg, J.B. Orlin, and R.E. Tarjan, "Finding minimum-cost flows by double scaling," Math. Program., vol. 53, pp. 243-266, 1992.
3. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows, Prentice Hall: Englewood Cliffs, New Jersey, 1993.
4. KB. Baker, P. Dixon, M.J. Magazine, and E.A. Silver, "An algorithm for the dynamic lot-size problem with time-varying production capacity constraints," Manage. Sci., vol. 24, no. 16, pp. 1710-1720, 1978.
5. G.R. Bitran and H. Matsuo, "Approximation formulations for the single-product capacitated lot size problem," Oper. Res., vol. 34, no. 1, pp. 63-74, 1986.
6. G.R. Bitran and H.H. Yanasse, "Computational complexity of the capacitated lot size problem," Manage. Sci., vol. 28, no. 10, pp. 1174-1186, 1982.
7. H. Booth and R.E. Tarjan, "Finding the minimum-cost maximum flow in a series-parallel network," J. Algorithm, vol. 15, pp. 416-446, 1993.
8. 2) Algorithm for the NI/G/NI/ND capacitated lot size problem," Manage. Sci., vol. 3, pp. 420-425, 1988.
9. R. J. Duffin, "Topology of series-parallel networks," J. Math. Applic., vol. 10, pp. 303-318, 1965.
10. S.S. Erenguc and M. Mercan, "On the joint lot-sizing problem with zero setup costs," Decisions Sciences, vol. 20, no. 4, pp. 669-676, 1989.
11. A. Federgruen and M. Tzur, "A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(n logn) or O(n)," Manage. Sci., vol. 37, no. 8, pp. 909-925, 1991.
12. M. Florian and M. Klein, "Deterministic production planning with concave costs and capacity constraints," Manage. Sci., vol. 18, no. 1, pp. 12-20, 1971.
13. M. Florian, J.K. Lenstra, and A.H.G. Rinnooy Kan, "Deterministic production planning: Algorithms and complexity," Manage. Sci., vol. 26, no. 7, pp. 669-679, 1980.
14. A.V. Goldberg and R.E. Tarjan, "Solving minimum cost flow problem by successive approximation," Math. Oper. Res., vol. 15, pp. 430-466, 1990.
15. J. Gutiérrez, A. Sedeño-Noda, M. Colebrook, and J. Sicilia, "A new characterization for the dynamic lot size problem with bounded inventory," Comput. Oper. Res., vol. 30, no. 3, pp. 383-395, 2003.
16. D.I. Hockstra, "Simple policies in the economic lot scheduling problem with zero setup costs," Prod. Plan. Control, vol. 8, no. 1, pp. 25-30, 1997.
17. R. Jagannathan and M.R. Rao, "A class of deterministic production planning problems," Manage. Sci., vol. 19, no. 11, pp. 1295-1300, 1973.
18. LEDA User Manual (version 4.2.1) at www.mpi-sb.mpg.de/LEDA/MANUAL/MANUAL. html
19. F. Louveaux, "An algorithm for deterministic production planning with concave costs and capacity constraints," Discussion Paper No. 7401, Universite Catholique de Louvain, Louvain, Belgium, 1974.
20. S.F. Love, "Bounded production and inventory models with piecewise concave costs," Manage. Sci., vol. 20, no. 3, pp. 313-318, 1973.
21. A.S. Manne, "Programming of economic lot sizes," Manage. Sci., vol. 4, pp. 115-135, 1958.
22. J.B. Orlin, "A faster strongly polynomial minimum cost flow algorithm," Oper. Res., vol. 41, no. 2, pp. 338-350, 1993.
23. W. Röckelein, "Systems for purchases on the internet requirements and evaluation," Presented in the Fifth Symposium on Research and Teaching in Electronic Commerce, Bled, Slovenia, 1995.
24. C. Swoveland, "A deterministic multi-period production planning model with piecewise concave production and holding-backorder costs," Manage. Sci., vol. 21, no. 9, pp. 1007-1013, 1975.
25. 3) algorithm for the economic lot-sizing problem with constant capacities," Manage. Sci., vol. 42, no. 1, pp. 142-150, 1996.
26. C.P.M. Van Hoesel and A.P.M. Wagelmans, "Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems," Math. Oper. Res, vol. 26, pp. 339-357, 2001.
27. A.F. Veinott, "Production planning with convex costs: A parametric study," Manage. Sci., vol. 10, pp. 441-460, 1964.
28. A.P.M. Wagelmans, S.P.M. Van Hoesel, and A. Kolen, "Economic lot sizing: An O(nlogn) algorithm that runs in linear time in the Wagner-Whitin case," Oper. Res., vol. 40, no. 1, pp. 145-156, 1992.
29. H.M. Wagner and T.Whitin, "Dynamic version of the economic lot size model," Manage. Sci., vol. 5, pp. 89-96, 1958.
30. W.I. Zangwill, "A deterministic multi-period production scheduling model with backlogging," Manage. Sci., vol. 13, pp. 105-119, 1966.