Comparison of Policies for Routing Customers to Parallel Queueing Systems

D. J. Houck
Additional contact information
D. J. Houck: AT&T Bell Laboratories, Holmdel, New Jersey

Operations Research, 1987, vol. 35, issue 2, 306-310

Abstract: This paper studies a queueing system with two groups of servers, each with a separate queue, and with arriving customers routed irrevocably to one of the two queues. One natural policy for routing arriving customers is to send them to the queue with the shortest expected delay. Although this shortest delay routing policy (SDR) is known to be optimal if each server group has one server and the service time distribution has nondecreasing failure rate, little is known about the general multiserver case, even with exponential service times. In this paper we show, using a theoretical upper bound, that an optimal policy would produce delays that are almost identical to what would result from combining the two groups. In addition, our simulation results show that SDR performs nearly optimally in every case considered.

Keywords: 699 optimal queueing policies; 702 queueing simulation (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.35.2.306 (application/pdf)

Related works:
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:inm:oropre:v:35:y:1987:i:2:p:306-310

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().