We consider a multiple server queueing loss system where the service times of server i are exponential with rate μi, where μi decreases in i. Arrivals have associated vectors (X1, …, Xn) of binary variables, with Xi = 1 indicating that server i
is eligible to serve that arrival. Arrivals finding no idle eligible servers are lost. Letting Ij be the indicator variable for the event that the jth arrival enters service, we show that, for any arrival process, the policy that assigns arrivals to the smallest numbered idle eligible server stochastically maximizes the vector (I1, …, Ir) for every r if the eligibility vector of arrivals is either (a) exchangeable, or (b) a vector of independent variables for which P(Xi = 1) increases in i.
