Optimally of shortest queue routing for dependent service stations

We consider a system in which customers arrive singly or in batches to a group of service stations. Via a Markov decision process argument, we establish general conditions on the state-dependent arrival, service and holding cost rates such that shortest queue routing (SQR) is optimal. In particular, our conditions allow each station to be a ??/M/s queue.