Optimal scheduling in queueing networks

This paper derives an algorithm for finding a scheduling discipline for scheduling N customers at M service stations in a closed queueing network so as to optimize a performance measure which depends on the configuration of customers at the service stations.