Fluid approximation of a controlled multiclass tandem network

摘要

A two-station, four-class queueing network with dynamic scheduling of servers is analyzed. It is shown that the corresponding Markov decision problem converges under fluid scaling to a fluid optimal control model. The structure of the optimal policy for the fluid network, and of an asymptotically optimal policy for the queueing network are derived in an explicit form. They concur with the tandem μc-rule, if this policy gives priority to the same flow of customers in both stations. In general, they are monotone with a linear switching surface.