Obtaining Fast Service in a Queueing System via Performance-Based Allocation of Demand
AbstractAny buyer that depends on suppliers for the delivery of a service or the production of a make-to-order component should pay close attention to the suppliers' service or delivery lead times. This paper studies a queueing model in which two strategic servers choose their capacities/processing rates and faster service is costly. The buyer allocates demand to the servers based on their performance; the faster a server works, the more demand the server is allocated. The buyer's objective is to minimize the average lead time received from the servers. There are two important attributes to consider in the design of an allocation policy: the degree to which the allocation policy effectively utilizes the servers' capacities and the strength of the incentives the allocation policy provides for the servers to work quickly. Previous research suggests that there exists a trade-off between efficiency and incentives, i.e., in the choice between two allocation policies a buyer may prefer the less efficient one because it provides stronger incentives. We find considerable variation in the performance of allocation policies: Some intuitively reasonable policies generate essentially no competition among servers to work quickly, whereas others generate too much competition, thereby causing some servers to refuse to work with the buyer. Nevertheless, the trade-off between efficiency and incentives need not exist: It is possible to design an allocation policy that is efficient and also induces the servers to work quickly. We conclude that performance-based allocation can be an effective procurement strategy for a buyer as long as the buyer explicitly accounts for the servers' strategic behavior.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 53 (2007)
Issue (Month): 3 (March)
game theory; joining behavior; Nash equilibrium; procurement; sourcing; supplier management;
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- James J. Anton & Sandro Brusco & Giuseppe Lopomo, 2010.
"Split-Award Procurement Auctions with Uncertain Scale Economies: Theory and Data,"
10-32, Duke University, Department of Economics.
- Anton, James J. & Brusco, Sandro & Lopomo, Giuseppe, 2010. "Split-award procurement auctions with uncertain scale economies: Theory and data," Games and Economic Behavior, Elsevier, vol. 69(1), pages 24-41, May.
- Elahi, Ehsan, 2013. "Outsourcing through competition: What is the best competition parameter?," International Journal of Production Economics, Elsevier, vol. 144(1), pages 370-382.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.