Queueing Problems with Two Parallel Servers

Youngsub Chun and Eun Jeong Heo

ISER Discussion Paper from Institute of Social and Economic Research, The University of Osaka

Abstract: A group of agents are waiting for their job to be processed in a facility. We assume that each agent needs the same amount of processing time and incurs waiting costs. The facility has two parallel servers, being able to serve two agents at a time. We are interested in finding the order to serve agents and the (positive or negative) monetary compensations they should receive. We introduce two rules for the problem, the minimal transfer rule and the maximal transfer rule. We show that these two rules correspond to the Shapley (1953) value of the queueing games with two servers, as discussed similarly by Maniquet (2003) and Chun (2006a) for queueing problems with one serve, when the worth of each coalition is appropriately defined. If the worth of a coalition is defined by assuming the coalitional members are served before the non-coalitional members, then the minimal transfer rule is obtained. On the other hand, if it is defined by assuming the coalitional members are served after the non-coalitional members, then the maximal transfer rule is obtained.

Date: 2007-03
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.iser.osaka-u.ac.jp/static/resources/docs/dp/2007/DP0683.pdf

Related works:
Chapter: Queueing Problems with Two Parallel Servers (2016)
Journal Article: Queueing problems with two parallel servers (2008)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:dpr:wpaper:0683

Access Statistics for this paper

More papers in ISER Discussion Paper from Institute of Social and Economic Research, The University of Osaka Contact information at EDIRC.
Bibliographic data for series maintained by Librarian ().