Performance evaluation of scheduling control of queueing networks: Fluid model heuristics

Motivated by dynamic scheduling control for queueing networks, Chen and Yao [8] developed a systematic method to generate dynamic scheduling control policies for a fluid network, a simple and highly aggregated model that approximates the queueing network. This study addresses the question of how good these fluid policies are as heuristic scheduling policies for queueing networks. Using simulation on some examples these heuristic policies are compared with traditional simple scheduling rules. The results show that the heuristic policies perform at least comparably to classical priority rules, regardless of the assumptions made about the traffic intensities and the arrival and service time distributions. However, they are certainly not always the best and, even when they are, the improvement is seldom dramatic. The comparative advantage of these policies may lie in their application to nonstationary situations such as might occur with unreliable machines or nonstationary demand patterns.