Warranty Matching in a Consumer Electronics Closed-Loop Supply Chain

Author:

Calmon Andre P.1ORCID,Graves Stephen C.2ORCID,Lemmens Stef3ORCID

Affiliation:

1. Technology and Operations Management, INSEAD, 77300 Fontainebleau, France;

2. MIT Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02142;

3. Rotterdam School of Management, Erasmus University Rotterdam, 3062 PA Rotterdam, Zuid-Holland, Netherlands

Abstract

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.

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Strategy and Management

Reference31 articles.

1. A typology of remanufacturing in closed-loop supply chains

2. Online algorithms: a survey

3. Mix and match: A strategyproof mechanism for multi-hospital kidney exchange

4. Nonsimultaneous Chains and Dominos in Kidney- Paired Donation-Revisited

5. 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.

Cited by 8 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3