Queueing Models with Multiple Waiting Lines
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
We study a heterogeneous multi-server queueing system in which the minimum expected delay routing policy is used, i.e., an arriving customer is assigned to the queue which has the minimal expected value of unfinished work. This routing discipline can be viewed as a generalization of the join-the-shortest queue (SQ) discipline for homogeneous servers. We provide a methodology to compute upper and lower bounds on the mean response time of the system. This methodology allows one to tradeoff the tightness of the bounds and computational cost. Examples are presented which show the excellent relative accuracy achievable with modest computational cost.