A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is
We consider the problem of routeing customers to one of two parallel queues. Arrivals are independent of the state of the system but otherwise arbitrary. Assuming that queues have infinite capacities and the service times form a sequence of i.i.d. random variables with increasing likelihood ratio (ILR) distribution, we prove that the shortest queue (SQ) policy minimizes various cost functionals related to queue lengths and response times. We give a counterexample which shows that this result isdoi:10.1239/jap/1032374764 fatcat:xjiqwcxxozakboupk66barklby