Dynamic lot sizing with returning items and disposals

References

• Aggarwal . A. and Park , J.K. ( 1993 ) Improved algorithms for economic lot size problems. Operations Research , 41 . 549 – 571 .
   Web of Science ®Google Scholar
• Beltran , J. L. ( 1998 ) On inventory models with salable returns. Ph. D. Dissertation. Faculty of Management , University of Toronto. Toronto . Canada .
   Google Scholar
• Beltran , J.L. , Beyer . D. , Krass . D. and Ramaswami . S. ( 1998 ) Stochastic inventory models with returns and delivery commitmentz. Working paper. Joseph L. Rotman School of Management. , University of Toronto. Toronto , Canada .
   Google Scholar
• Bahl . H.C. , Ritzman . L.R. and Gupta , J.N.D. ( 1987 ) Determining lot sizes and resources requirements: a review. Operations Research , 35 . 329 – 345 .
   Web of Science ®Google Scholar
• Bensoussan . A. , Crouhy , M. and Proth , J.M. ( 1983 ) Mathematical Theory of Production Planning. , North Holland , Amsterdam . The Netherlands .
   Google Scholar
• Chambers . M.L. and Eglese , R.W. ( 1986 ) Use of preview exercises to forecast demand for new lines in mail order. Journal of the Operational Research Society. , 37 . 267 – 273 .
   Web of Science ®Google Scholar
• Chand , S. and Morton , T.E. ( 1982 ) A perfect planning horizon procedure for a deterministic cash balance problem. Management Science , 28 . 652 – 669 .
   Web of Science ®Google Scholar
• Erickson , R.R. , Monrna , CL. and Veinou , Jr. , A.F. ( 1987 ) Send and split method for minimum concave costs network flows. Mathematics of Operations Research. , 12 ( 4 ), 634 – 664 .
   Web of Science ®Google Scholar
• Federgruen , A. and Tzur , M. ( 1991 ) A simple forward algorithm to solve general dynamic lot sizing models with n periods O(n log n) or O(n) Time. Management Science. , 37 , 909 – 925 .
   Web of Science ®Google Scholar
• Florian . M. Lenstra . J.K. and Rinnooy Kan . A.H.G. ( 1980 ) Deterministic production planning: algorithms and complexity. Management Science , 26 . 669 – 679 .
   Web of Science ®Google Scholar
• Graves . S.C. ( 1982 ) Using Lagrangian techniques to solve hierarchical production planning problems. Management Science , 28 . 260 – 275 .
   Web of Science ®Google Scholar
• Luss , H. ( 1982 ) Operations research and capacity expansion problems: a survey. Operations Research. , 30 . 907 – 947 .
   Web of Science ®Google Scholar
• Manne , A.S. ( 1958 ) Programming of economic lot sizes. Management Science. , 4 . 115 – 135 .
   Web of Science ®Google Scholar
• Thierry . M.C. , Salomon , M. , Van Nunen , J.A.E.E. and Van Wassen Senhove . L.N. ( 1995 ) Strategic production and operations management issues in product recovery management. California Management Review , 37 . 114 – 135 .
   Web of Science ®Google Scholar
• Van der Laan , E.A. , Dekker . R. , Ridder , A.A.N. , and Salomon . M. (1994) An (s.Q) inventory model with remanufacturing and disposal. International Journal of Production Economics , (in press),
   Web of Science ®Google Scholar
• Veinoll . Jr. , A.F. ( 1969 ) Minimum concave-cost solutions of Lconticf substitution models of multifucility inventory systems. Operations Research , 17 . 262 – 291 .
   Web of Science ®Google Scholar
• Wagelmans . A. , Van Hocsel , S. and Kolen . A. ( 1992 ) Economic lot sizing: an O(n log n) algorithm that runs in linear time in the Wagner-Whitin case. Operations Research , 40 , S145-S156.
   Web of Science ®Google Scholar
• Wagner , H.M. and Whitin . T.M. ( 1958 ) Dynamic version of the ceonomic lot size model. Munagentent Science. , 5 . 89 – 96 .
   Web of Science ®Google Scholar
• Zangwill . W.I. ( 1966 ) A deterministic multi-period production scheduling model with backlogging. Management Science , 12 , 105 – 119 .
   Google Scholar
• Zangwill . W.I. ( 1968 ) Minimum concave cost flows in certain networks. Management Science. , 14 . 429 – 450 .
   Web of Science ®Google Scholar
• Zangwill . W.I. ( 1969 ) A backlogging model and a multi-echelon model or a dynamic economic lot size production system - a network approach. Management Science , 15 . 506 – 527 .
   Web of Science ®Google Scholar