A martingale approach to the slow server problem

Abstract

A Markov queueing system having heterogeneous servers under a long-run average criterion is analyzed. A direct proof of the optimality of a stationary, Markov policy is given using martingale methods. Simultaneously, the problem is reduced to a linear programming problem. Analysis of the LP for a system having finite queueing length shows the optimal policy is not always of threshold type.