The slow server problem: a queue with stalling
Michael Rubinovitch · Journal of Applied Probability · 1985
A queue with Poisson arrivals and two different exponential servers is considered. It is assumed that customers are allowed tostall, i.e., to wait for a busy fast server at times when the slow server is free. A stochastic analysis of the queue is given, steady-state probabilities are computed, and policies for overall optimization are characterized and computed. The issue of individual customer's optimization versus overall optimization is also discussed.