Edinburgh Research Archive

Outsourcing warranty repairs: models for the allocation of failed items to multiple vendors

dc.contributor.author
Ding, Li
en
dc.date.accessioned
2019-02-15T14:18:29Z
dc.date.available
2019-02-15T14:18:29Z
dc.date.issued
2007
dc.description.abstract
en
dc.description.abstract
We consider a scenario in which several external service vendors are contracted to repair purchased items which fail under warranty. We develop and analyze various allocation models concerning how the repair work should be distributed among the vendors in a cost-effective manner. Furthermore, we depart from previous work by arguing the importance of approaches to the modelling of goodwill costs which penalize long waits experienced by individual customers.
en
dc.description.abstract
We firstly study a simple static allocation model with a fixed warranty population. Both theoretical considerations and numerical results show that a simple greedy approach to the distribution of items under static models works outstandingly well. However, such a static formulation ignores the stochastic nature of the warranty population. Hence, we develop a second allocation model in which new equipment purchases are made according to a compound Poisson process. As in the static allocation model, the current information regarding the repair queue at each vendor is not available to the decision maker. The resulting stochastic dynamic optimization problem is non-standard. We develop an effective allocation procedure to this non-standard problem using a dynamic programming policy improvement approach. We report representative results from a simulation investigation to evaluate the status of the allocation heuristic developed in comparison to two simpler heuristics suggested by static models. Thirdly, we propose a dynamic allocation model which utilizes data on the queue length at each vendor for decisions on the routing of real-time failures to the vendors. Due to the problem size and state space in practice, traditional stochastic dynamic programming is not a realistic and computationally viable option. Hence, Whittle's restless bandits approach is deployed to develop the index-based heuristic for this dynamic allocation problem. A crucial theoretical result in this part of the study is that the system considered is indeed indexable. All the numerical results reported show that the performance of the derived index policy from the restless bandit is superior to that of a range of alternatives.
en
dc.identifier.uri
http://hdl.handle.net/1842/33696
dc.publisher
The University of Edinburgh
en
dc.relation.ispartof
Annexe Thesis Digitisation Project 2019 Block 22
en
dc.relation.isreferencedby
Already catalogued
en
dc.title
Outsourcing warranty repairs: models for the allocation of failed items to multiple vendors
en
dc.type
Thesis or Dissertation
en
dc.type.qualificationlevel
Doctoral
en
dc.type.qualificationname
PhD Doctor of Philosophy
en

Files

Original bundle

Now showing 1 - 1 of 1
Name:
DingL_2007redux.pdf
Size:
23.44 MB
Format:
Adobe Portable Document Format

This item appears in the following Collection(s)