Inventory Management for an Assembly System with Product or Component Returns

Published Online:https://doi.org/10.1287/mnsc.1050.0394

References

  • Chen F., Zheng Y. Lower bounds for multi-echelon stochastic inventory systems. Management Sci. (1994) 40:1426–1443LinkGoogle Scholar
  • Clark A., Scarf H. Optimal policies for a multi-echelon inventory problem. Management Sci. (1960) 6:475–490LinkGoogle Scholar
  • Cohen M., Nahmias S., Pierskalla W. A dynamic inventory system with recycling. Naval Res. Logist. Quart. (1980) 27:289–296CrossrefGoogle Scholar
  • DeCroix G. Optimal inventory policy for a multi-echelon inventory system with remanufacturing. Oper. Res. (2001) . ForthcomingGoogle Scholar
  • DeCroix G., Song J.-S., Zipkin P. A series system with returns: Stationary analysis. Oper. Res. (2005) 53:350–362LinkGoogle Scholar
  • Dekker R., Fleischmann M., Inderfurth K., van Wassenhove L.Reverse Logistics: Quantitative Models for Closed-Loop Supply Chains (2004) (Springer, New York) CrossrefGoogle Scholar
  • Diem W. Makers must dispose of autos. Detroit Free Press (1999) September 2):4Google Scholar
  • Ding F.-Y., Hodgson T., King R. A methodology for computation reduction for specially structured large scale Markov decision problems. Eur. J. Oper. Res. (1988) 34:105–112CrossrefGoogle Scholar
  • Federgruen A., Zipkin P. Computational issues in an infinite-horizon, multiechelon inventory model. Oper. Res. (1984) 32:818–836LinkGoogle Scholar
  • Fleischmann M. Quantitative models for reverse logistics. (2000) . Ph.D. thesis, Erasmus University, Rotterdam, The NetherlandsGoogle Scholar
  • Fleischmann M., Kuik R., Dekker R. Controlling inventories with stochastic item returns: A basic model. Eur. J. Oper. Res. (2002) 138:63–75CrossrefGoogle Scholar
  • Fleischmann M., Bloemhof-Ruwaard J. M., Dekker R., van der Laan E., van Nunen J. A. E. E., van Wassenhove L. N. Quantitative models for reverse logistics: A review. Eur. J. Oper. Res. (1997) 103:1–17CrossrefGoogle Scholar
  • Frankel C. The environment. IEEE Spectrum (1996) 33:76–81CrossrefGoogle Scholar
  • Heyman D., Sobel M.Stochastic Models in Operations Research (1984) II(McGraw-Hill, New York) Google Scholar
  • Howard R.Dynamic Programming and Markov Processes (1960) (MIT Press, Cambridge, MA) Google Scholar
  • Inderfurth K. Simple optimal replenishment and disposal policies for a product recovery system with leadtimes. OR Spektrum (1997) 19:111–122CrossrefGoogle Scholar
  • Kelle P., Silver E. Purchasing policy of new containers considering the random returns of previously issued containers. IIE Trans. (1989) 21:349–354CrossrefGoogle Scholar
  • Kiesmueller G., van der Laan E. An inventory model with dependent product demands and returns. Internat. J. Production Econom. (2001) 72:73–87CrossrefGoogle Scholar
  • Mahadevan B., Pyke D., Fleischmann M. Periodic review, push inventory policies for remanufacturing. Eur. J. Oper. Res. (2003) 151:536–551CrossrefGoogle Scholar
  • Rosling K. Optimal inventory policies for assembly systems under random demands. Oper. Res. (1989) 37:565–579LinkGoogle Scholar
  • Scarf H., Arrow K., Karlin S., Suppes P. The optimality of (s, S) policies in the dynamic inventory problem. Mathematical Models in the Social Sciences (1960) (Stanford University Press, Stanford, CA) Google Scholar
  • Schmidt C., Nahmias S. Optimal policy for a two-stage assembly system under random demand. Oper. Res. (1985) 33:1130–1145LinkGoogle Scholar
  • Simpson V. Optimum solution structure for a repairable inventory problem. Oper. Res. (1978) 26:270–281LinkGoogle Scholar
  • Tedeschi B. Online retailers grapple with the age-old problem of handling returned merchandise. The New York Times (2001) May 28):C6Google Scholar
  • Toktay L. B., Wein L., Zenios S. Inventory management of remanufacturable products. Management Sci. (2000) 46:1412–1426LinkGoogle Scholar
  • Zipkin P.Foundations of Inventory Management (2000) (McGraw-Hill, New York) Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.