event
Stochastics Seminar :: Dynamic Scheduling in Stochastic Processing Networks
Primary tabs
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)
Status
-
Workflow Status:
Published -
Created By:
Barbara Christopher -
Created:
10/08/2010 -
Modified By:
Fletcher Moore -
Modified:
10/07/2016
Categories
Keywords
-
No keywords were submitted.
Target Audience
-
No target audience selected.