Stern School of Business >
IOMS: Operations Management Working Papers >
Please use this identifier to cite or link to this item:
|Title: ||A Heavy Traffic Approximation for Queues with Restricted Customer-Server Matchings|
|Authors: ||Caldentey, René A.|
Kaplan, Edward H.
|Issue Date: ||2007|
|Publisher: ||Stern School of Business, New York University|
|Series/Report no.: ||OM-2007-04|
|Abstract: ||We consider a queuing system with n customer classes and m servers. For each
class i there is only a subset S(i) of servers that are able to process customer' i requests and they do that using a first-come-first-serve discipline. For this system, we are primarily interested in computing Pij , the steady-state fraction of class-i customers that are served by server j. We also look at stability conditions and standard performance measures like waiting times and queue lengths. Under the assumption that the system is heavy loaded, we approximate Pij as well as the other performance measures. Computational experiments are used to show the quality of our approximations.|
|Appears in Collections:||IOMS: Operations Management Working Papers|
Items in Faculty Digital Archive are protected by copyright, with all rights reserved, unless otherwise indicated.