A Greedy Algorithm for Capacitated Lot-Sizing Problems

References

• Federgruen , A. and Tzur , M. 1991 . A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(n log n) or O(n) time . Management Science , 37 : 909 – 925 .
   Web of Science ®Google Scholar
• Bitran , G.B. and Yanasse , H.H. 1982 . Computational complexity of the capacitated lot size problem . Management Science , 28 : 1174 – 1185 .
   Web of Science ®Google Scholar
• van Hoesel , C.P. M. and Wagelmans , A.P. M. 1996 . An O(T3) algorithm for the economic lot-sizing problem with constant capacities . Management Science , 42 : 142 – 150 .
   Web of Science ®Google Scholar
• Kovalev , M.M. 1987 . Matroids In Discrete Optimization , Minsk : Universitetskoje .
   Google Scholar
• Fujishige , S. 1991 . Submodular functions and optimization. Annals of Discrete Mathematics , Vol. 47 , North-Holland : Elsevier Science Publishers .
   Google Scholar
• Edmonds , J. 1970 . “ Submodular functions, matroids, and certain polyhedra ” . In Combinatorial Structures and Their Applications , Edited by: Guy , R. , Hanani , H. , Sauer , N. and Schönheim , J. 69 – 87 . New York : Gordon and Breach .
   Google Scholar
• Hochbaum , Dorit S. 1994 . Lower and upper bounds for the allocation problem and other nonlinear optimization problems . Mathematics of Operations Research , 19 : 390 – 409 .
   Web of Science ®Google Scholar