.png){kind=icon}
.png){kind=icon}
Return
Cooperation in Markovian queueing models
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2007.04.053.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (c) 2007 Elsevier B.V. All rights reserved.
Keywords:
Markovian queues
cooperative games
allocation rules
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
View more organizations