Optimality of routing and servicing in dependent parallel processing systems (Q1177919)

The `` shortest queue'' problem for parallel service channels with different service rates deals with the question, when it is optimal for an arriving customer to join the shortest queue, or in general with finding optimal policies for joining parallel queues. Additionally in the paper it is assumed that there is some free service capacity which can for some time be given to one of the channels. The question is now, whether this should be given to the server with the longest queue. Under some structural assumptions these intuitive policies are shown to be optimal with respect to stochastic submajorization ordering.