Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
482914 | European Journal of Operational Research | 2008 | 11 Pages |
Abstract
In this paper we study some cooperative models in Markovian queues. We stress the case of several agents agreeing to maintain a common server for their populations in which a priority scheme with preemption has been established. In this situation we propose and characterize an allocation rule for the holding costs that provides core allocations.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
M.D. García-Sanz, F.R. Fernández, M.G. Fiestras-Janeiro, I. García-Jurado, J. Puerto,