Article ID: | iaor20063109 |
Country: | United States |
Volume: | 52 |
Issue: | 5 |
Start Page Number: | 381 |
End Page Number: | 398 |
Publication Date: | Aug 2005 |
Journal: | Naval Research Logistics |
Authors: | Kulkarni Vidyadhar G., Glazebrook Kevin, Opp Michelle |
Keywords: | programming: dynamic |
In this paper we consider the problem of minimizing the costs of outsourcing warranty repairs when failed items are dynamically routed to one of several service vendors. In our model, the manufacturer incurs a repair cost each time an item needs repair and also incurs a goodwill cost while an item is awaiting and undergoing repair. For a large manufacturer with annual warranty costs in the tens of millions of dollars, even a small relative cost reduction from the use of dynamic (rather than static) allocation may be practically significant. However, due to the size of the state space, the resulting dynamic programming problem is not exactly solvable in practice. Furthermore, standard routing heuristics, such as join-the-shortest-queue, are simply not good enough to identify potential cost savings of any significance. We use two different approaches to develop effective, simply structured index policies for the dynamic allocation problem. The first uses dynamic programming policy improvement while the second deploys Whittle's proposal for restless bandits. The closed form indices concerned are new and the policies sufficiently close to optimal to provide cost savings over static allocation. All results of this paper are demonstrated using a simulation study.