Warranty Matching in a Consumer Electronics Closed-Loop Supply Chain

Published Online:https://doi.org/10.1287/msom.2020.0889

References

  • Abbey JD , Guide VDR (2018) A typology of remanufacturing in closed-loop supply chains. Internat. J. Production Res. 56(12):374–384.CrossrefGoogle Scholar
  • Albers S (2003) Online algorithms: A survey. Math. Programming 97(1–2):3–26.CrossrefGoogle Scholar
  • Andersson T , Ehlers L , Martinello A (2018) Dynamic refugee matching. Working Paper 2018:7, Department of Economics School of Economics and Management, Lund University, Lund, Sweden.Google Scholar
  • Ashlagi I , Fischer F , Kash IA , Procaccia AD (2015) Mix and match: A strategyproof mechanism for multi-hospital kidney exchange. Games Econom. Behav. 91(May):284–296.CrossrefGoogle Scholar
  • Ashlagi I , Gilchrist DS , Roth AE , Rees MA (2011) Nonsimultaneous chains and dominos in kidney-paired donation—Revisited. Amer. J. Transplantation 11(5):984–994.CrossrefGoogle Scholar
  • Aziz H , Chen J , Gaspers S , Sun Z (2018) Stability and Pareto optimality in refugee allocation matchings. Proc. 17th Internat. Conf. Autonomous Agents MultiAgent Systems (International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC), 964–972.Google Scholar
  • Bansal N , Buchbinder N , Gupta A , Naor JS (2007) An O(log2 k)-competitive algorithm for metric bipartite matching. Arge L , Hoffmann M , Welzl E , eds. Algorithms-ESA 2007, Lecture Notes in Computer Science, vol. 4698 (Springer, Berlin), 522–533.Google Scholar
  • Boxma OJ , David I , Perry D , Stadje W (2011) A new look at organ transplantation models and double matching queues. Probab. Engrg. Inform. Sci. 25(2):135–155.CrossrefGoogle Scholar
  • Calmon AP (2015) Reverse logistics for consumer electronics: Forecasting failures, managing inventory, and matching warranties. Unpublished PhD thesis, Massachusetts Institute of Technology, Cambridge.Google Scholar
  • Calmon AP , Graves SC (2017) Inventory management in a consumer electronics closed-loop supply chain. Manufacturing Service Oper. Management 19(4):568–585.LinkGoogle Scholar
  • Cohen MA , Pierskalla WP (1975) Management policies for a regional blood bank. Transfusion 15(1):58–67.CrossrefGoogle Scholar
  • Galbreth MR , Blackburn JD (2006) Optimal acquisition and sorting policies for remanufacturing. Production Oper. Management 15(3):384–392.CrossrefGoogle Scholar
  • Gale D , Shapley LS (1962) College admissions and the stability of marriage. Amer. Math. Monthly 69(1):9–15.CrossrefGoogle Scholar
  • Guide VDR , Van Wassenhove LN (2009) The evolution of closed-loop supply chain research. Oper. Res. 57(1):10–18.LinkGoogle Scholar
  • Gusfield D , Irving RW (1989) The Stable Marriage Problem: Structure and Algorithms (MIT Press, Cambridge, MA).Google Scholar
  • Hitsch GJ , Hortaçsu A , Ariely D (2010) Matching and sorting in online dating. Amer. Econom. Rev. 100(1):130–163.CrossrefGoogle Scholar
  • Hu M , Zhou Y (2016) Dynamic type matching. Rotman School of Management Working Paper 2592622, University of Toronto, Toronto.Google Scholar
  • Huang W , Kulkarni V , Swaminathan JM (2008) Managing the inventory of an item with a replacement warranty. Management Science 54(8):1441–1452.Google Scholar
  • Huang Z , Peng B , Tang ZG , Tao R , Wu X , Zhang Y (2019) Tight competitive ratios of classic matching algorithms in the fully online model. Proc. 30th Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia) , 2875–2886.Google Scholar
  • Jagannathan R , Sen TK (1991) Storing crossmatched blood: A perishable inventory model with prior allocation. Management Sci. 37(3):251–266.LinkGoogle Scholar
  • Jennings JB (1973) Blood bank inventory control. Management Sci. 19(6):637–645.LinkGoogle Scholar
  • Kennes J , Monte D , Tumennasan N (2014) The day care assignment: A dynamic matching problem. Amer. Econom. J. Microeconom. 6(4):362–406.CrossrefGoogle Scholar
  • Kuhn HW (1955) The Hungarian method for the assignment problem. Naval Res. Logist. Quart. 2(1–2):83–97.CrossrefGoogle Scholar
  • Kurino M (2014) House allocation with overlapping agents: A dynamic mechanism design approach. Amer. Econom. J. Microeconom. 6(1):258–289.CrossrefGoogle Scholar
  • Lubin M , Dunning I (2015) Computing in operations research using Julia. INFORMS J. Comput. 27(2):238–248.LinkGoogle Scholar
  • Manshadi VM , Gharan SO , Saberi A (2012) Online stochastic matching: Online actions based on offline statistics. Math. Oper. Res. 37(4):559–573.LinkGoogle Scholar
  • Meyerson A , Nanavati A , Poplawski L (2006) Randomized online algorithms for minimum metric bipartite matching. Proc. 17th Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 954–959.Google Scholar
  • Özkan E , Ward AR (2020) Dynamic matching for real-time ridesharing. Stochastic Systems 10(1):29–70.Google Scholar
  • Pegels CC , Jelmert AE (1970) An evaluation of blood-inventory policies: A Markov chain application. Oper. Res. 18(6):1087–1098.LinkGoogle Scholar
  • Pince C , Ferguson M , Toktay B (2016) Extracting maximum value from consumer returns: Allocating between remarketing and refurbishing for warranty claims. Manufacturing Service. Oper. Management 18(4):475–492.LinkGoogle Scholar
  • Roth AE (2003) The origins, history, and design of the resident match. J. Amer. Medical Assoc . 289(7):909–912.CrossrefGoogle Scholar
  • Roth AE , Sotomayor MAO (1992) Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis (Cambridge University Press, Cambridge, UK).Google Scholar
  • Sarhangian V , Abouee-Mehrizi H , Baron O , Berman O (2018) Threshold-based allocation policies for inventory management of red blood cells. Manufacturing Service Oper. Management 20(2):347–362.LinkGoogle Scholar
  • Savaskan RC , Bhattacharya S , Van Wassenhove LN (2004) Closed-loop supply chain models with product remanufacturing. Management Sci. 50(2):239–252.LinkGoogle Scholar
  • Slaugh VW , Akan M , Kesten O , Ünver MU (2016) The Pennsylvania Adoption Exchange improves its matching process. Interfaces 46(2):133–153.LinkGoogle Scholar
  • Souza GC (2013) Closed-loop supply chains: A critical review, and future research. Decision Sci. 44(1):7–38.CrossrefGoogle Scholar
  • Truong V-A , Wang X (2018) Online two-sided bipartite matching. Working paper, Columbia University, New York.Google Scholar
  • Ünver MU (2010) Dynamic kidney exchange. Rev. Econom. Stud. 77(1):372–414.CrossrefGoogle Scholar
  • Yan C , Zhu H , Korolko N , Woodard D (2019) Dynamic pricing and matching in ride-hailing platforms. Naval Res. Logist. , ePub ahead of print November 15, https://doi.org/10.1002/nav.21872.CrossrefGoogle 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.