Warranty Matching in a Consumer Electronics Closed-Loop Supply Chain

Problem definition: We examine a dynamic assignment problem faced by a large wireless service provider (WSP) that is a Fortune 100 company. This company manages two warranties: (i) a customer warranty that the WSP offers its customers and (ii) an original equipment manufacturer (OEM) warranty that OEMs offer the WSP. The WSP uses devices refurbished by the OEM as replacement devices, and hence their warranty operation is a closed-loop supply chain. Depending on the assignment the WSP uses, the customer and OEM warranties might become misaligned for customer-device pairs, potentially incurring a cost for the WSP. Academic/practical relevance: We identify, model, and analyze a new dynamic assignment problem that emerges in this setting called the warranty matching problem. We introduce a new class of policies, called farsighted policies, which can perform better than myopic policies. We also propose a new heuristic assignment policy, the sampling policy, which leads to a near-optimal assignment. Our model and results are motivated by a real-world problem, and our theory-guided assignment policies can be used in practice; we validate our results using data from our industrial partner. Methodology: We formulate the problem of dynamically assigning devices to customers as a discrete-time stochastic dynamic programming problem. Because this problem suffers from the curse of dimensionality, we propose and analyze a set of reasonable classes of assignment policies. Results: The performance metric that we use for a given assignment policy is the average time that a replacement device under a customer warranty is uncovered by an OEM warranty. We show that our assignment policies reduce the average uncovered time and the expected number of out-of-OEM-warranty returns by more than 75% in comparison with our industrial partner’s current assignment policy. We also provide distribution-free bounds for the performance of a myopic assignment policy and of random assignment, which is a proxy for the WSP’s current policy. Managerial implications: Our results indicate that, in closed-loop supply chains, being completely farsighted might be better than being completely myopic. Also, policies that are effective in balancing short-term and long-term costs can be simple and effective, as illustrated by our sampling policy. We describe how the performance of myopic and farsighted policies depend on the size and length of inventory buildup.

[1]  Ming Hu,et al.  Dynamic Type Matching , 2016, Manuf. Serv. Oper. Manag..

[2]  Dawn B. Woodard,et al.  Dynamic pricing and matching in ride‐hailing platforms , 2019, Naval Research Logistics (NRL).

[3]  Yuhao Zhang,et al.  Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model , 2019, SODA.

[4]  D. Woodard,et al.  Dynamic pricing and matching in ride‐hailing platforms , 2018, Naval Research Logistics (NRL).

[5]  Jiayin Chen,et al.  Stability and Pareto Optimality in Refugee Allocation Matchings , 2018, AAMAS.

[6]  Tommy Andersson,et al.  Dynamic Refugee Matching , 2018 .

[7]  V. Daniel R. Guide,et al.  A typology of remanufacturing in closed-loop supply chains , 2018, Int. J. Prod. Res..

[8]  Oded Berman,et al.  Threshold-Based Allocation Policies for Inventory Management of Red Blood Cells , 2018, Manuf. Serv. Oper. Manag..

[9]  Van-Anh Truong,et al.  Online Two-sided Bipartite Matching , 2018 .

[10]  Amy R. Ward,et al.  Dynamic Matching for Real-Time Ridesharing , 2017, Stochastic Systems.

[11]  Stephen C. Graves,et al.  Inventory Management in a Consumer Electronics Closed-Loop Supply Chain , 2016, Manuf. Serv. Oper. Manag..

[12]  Çerag Pinçe,et al.  Extracting Maximum Value from Consumer Returns: Allocating Between Remarketing and Refurbishing for Warranty Claims , 2016, Manuf. Serv. Oper. Manag..

[13]  Mustafa Akan,et al.  The Pennsylvania Adoption Exchange Improves Its Matching Process , 2016, Interfaces.

[14]  Iain Dunning,et al.  Computing in Operations Research Using Julia , 2013, INFORMS J. Comput..

[15]  Itai Ashlagi,et al.  Mix and match: A strategyproof mechanism for multi-hospital kidney exchange , 2013, Games Econ. Behav..

[16]  André du Pin Calmon,et al.  Reverse logistics for consumer electronics : forecasting failures, managing inventory, and matching warranties , 2015 .

[17]  Daniel Monte,et al.  The Day Care Assignment: A Dynamic Matching Problem , 2014 .

[18]  L. S. Shapley,et al.  College Admissions and the Stability of Marriage , 2013, Am. Math. Mon..

[19]  Gilvan C. Souza Closed-Loop Supply Chains: A Critical Review, and Future Research , 2013, Decis. Sci..

[20]  A. Roth,et al.  Nonsimultaneous Chains and Dominos in Kidney‐ Paired Donation—Revisited , 2011, American journal of transplantation : official journal of the American Society of Transplantation and the American Society of Transplant Surgeons.

[21]  Onno Boxma,et al.  A new look at organ transplantation models and double matching queues , 2010 .

[22]  Amin Saberi,et al.  Online stochastic matching: online actions based on offline statistics , 2010, SODA '11.

[23]  Morimitsu Kurino House allocation with overlapping generations , 2011 .

[24]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[25]  Morimitsu Kurino,et al.  House allocation with overlapping agents: A dynamic mechanism design approach , 2009 .

[26]  Michael R. Galbreth,et al.  Optimal Acquisition and Sorting Policies for Remanufacturing , 2006 .

[27]  V. Daniel R. Guide,et al.  OR FORUM - The Evolution of Closed-Loop Supply Chain Research , 2009, Oper. Res..

[28]  Wei Huang,et al.  Managing the Inventory of an Item with a Replacement Warranty , 2008, Manag. Sci..

[29]  Günter J. Hitsch,et al.  Matching and Sorting in Online Dating , 2008 .

[30]  Joseph Naor,et al.  An O (log2 k )-Competitive Algorithm for Metric Bipartite Matching , 2007, ESA.

[31]  M. Utku Ünver,et al.  Dynamic Kidney Exchange , 2007 .

[32]  Adam Meyerson,et al.  Randomized online algorithms for minimum metric bipartite matching , 2006, SODA '06.

[33]  Luk N. Van Wassenhove,et al.  Closed - Loop Supply Chain Models with Product Remanufacturing , 2004, Manag. Sci..

[34]  Susanne Albers,et al.  Online algorithms: a survey , 2003, Math. Program..

[35]  A. Roth The origins, history, and design of the resident match. , 2003, JAMA.

[36]  Tarun K. Sen,et al.  Storing Crossmatched Blood: A Perishable Inventory Model with Prior Allocation , 1991 .

[37]  Alvin E. Roth,et al.  Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis , 1990 .

[38]  Robert W. Irving,et al.  The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.

[39]  W P Pierskalla,et al.  Management Policies for a Regional Blood Bank , 2003, Transfusion.

[40]  John B. Jennings,et al.  Blood Bank Inventory Control , 1973 .

[41]  C. Carl Pegels,et al.  An Evaluation of Blood-Inventory Policies: A Markov Chain Application , 1970, Oper. Res..