On the optimality of the shortest line discipline

We consider a many server queueing system with identical exponential servers. Customers arrive according to an arbitrary arrival process and upon arrival the customer must be assigned to some server's queue. We show that the shortest line discipline is the best decision rule when assigning the customers to the servers in the sense that the corresponding departure process is stochastically fastest.