The UvA-LINKER will give you a range of other options to find the full text of a publication (including a direct link to the full-text if it is located on another database on the internet).
De UvA-LINKER biedt mogelijkheden om een publicatie elders te vinden (inclusief een directe link naar de publicatie online als deze beschikbaar is in een database op het internet).
faculty: "FEB" and publication year: "2009"
| Authors||M. Opp, I. Adan, V.G. Kulkarni, J.M. Swaminathan|
|Title||Allocating outsourced warranty service contracts|
|Book/source title||Outsourcing, teamwork and business management|
|Publisher||Nova Science Publishers|
|Faculty||Faculty of Economics and Business|
|Institute/dept.||FEB: Amsterdam School of Economics Research Institute (ASE-RI)|
|Abstract||Motivated by our interactions with a leading manufacturer of computers, in this paper we consider static allocation as applied to the problem of minimizing the costs of outsourcing warranty services to repair vendors. Under static allocation, a manufacturer assigns each item to one of several contracted repair vendors; every time a particular item fails, it is sent to its preassigned vendor for repair. In our model, the manufacturer incurs a repair cost each time an item needs repair and also incurs a goodwill cost while items are undergoing repair. We model each service vendor as a finite population multi-server queueing system and formulate the resulting outsourcing problem as an integer-variable resource allocation problem. After establishing convexity results regarding the queue lengths at the repair vendors, we show that marginal allocation is optimal. Through a detailed computational study we compare the optimal algorithm with five static allocation heuristics in terms of time and optimality gap. Our study indicates that the optimal algorithm takes less than a minute to solve industry size problems on average. Further, the commonly used heuristics are far away from the optimal on average, thus emphasizing the benefits of the optimal allocation algorithm. We also compare the optimal static allocation to two simple dynamic allocation heuristics. The results of this study further validate the use of static allocation as a justifiable and easy-to-implement policy. Among other computational insights we show that when the number of items to be allocated is large, a single-server approximation leads to optimal allocations in most of the cases.|
Use this url to link to this page: http://dare.uva.nl/en/record/401408
Contact us about this recordNotify a colleague
Add to bookbag