Threshold policies minimizing customer mean flow time in simple (out-tree) queueing networks

An optimization problem concerning deterministic queuing networks is considered. The optimization problem examined is relevant to the routing policy of incoming customers which have to flow through the network. The cost functional is the customer mean flow time. The authors survey all the results previously obtained for the simplest case, and propose further results concerning more complex queuing networks