Ding, L. and Glazebrook, K. D. and Kirkbride, C. (2008) 'Allocation models and heuristics for the outsourcing of repairs for a dynamic warranty population.', Management science., 54 (3). pp. 594-607.
We consider a scenario in which a large equipment manufacturer wishes to outsource the work involved in repairing purchased goods while under warranty. Several external service vendors are available for this work. We develop models and analyses to support decisions concerning how responsibility for the warranty population should be divided between them. These also allow the manufacturer to resolve related questions concerning, for example, whether the service capacities of the contracted vendors are sufficient to deliver an effective post-sales service. Static allocation models yield information concerning the proportions of the warranty population for which the vendors should be responsible overall. Dynamic allocation models enable consideration of how such overall workloads might be delivered to the vendors over time in a way which avoids excessive variability in the repair burden. We apply dynamic programming policy improvement to develop an effective dynamic allocation heuristic. This is evaluated numerically and is also used as a yardstick to assess two simple allocation heuristics suggested by static models. A dynamic greedy allocation heuristic is found to perform well. Dividing the workload equally among vendors with different service capacities can lead to serious losses.
|Keywords:||Approximate dynamic programming, Greedy heuristics, Index policies, Outsourcing, Warranty repairs.|
|Full text:||Full text not available from this repository.|
|Publisher Web site:||http://dx.doi.org/10.1287/mnsc.1070.0750|
|Record Created:||22 May 2009 13:35|
|Last Modified:||19 Oct 2009 11:49|
|Social bookmarking:||Export: EndNote, Zotero | BibTex|
|Usage statistics||Look up in GoogleScholar | Find in a UK Library|