Stochastics Seminar :: Dynamic Scheduling in Stochastic Processing Networks
We consider a class of stochastic processing networks which are capable of modeling semiconductor wafer fabrication facilities, networks of data switches, and large scale call centers.
Assume the networks satisfy a so-called resource pooling condition. We prove a maximum pressure policy asymptotically minimizes the workload processes in heavy traffic. A key to the proof is to show the network processes exhibit state space collapse.
(joint with Jim Dai)