B. Ata and S. Kumar. Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies. to appear in Annals of Applied Probability.
S. L. Bell and R. J. Williams. Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: asymptotic optimality of a threshold policy. Ann. Appl. Probab., 11 (2001), 608--649.
J. M. Harrison. Heavy traffic analysis of a system with parallel servers: asymptotic optimality of discrete-review policies. Ann. Appl. Probab., 8 (1998), 822-848.
J. M. Harrison. Brownian models of open processing networks: canonical representation of workload. Ann. Appl. Probab., 10 (2000), 75-103. Correction: 13 (2003), 390--393.
H. J. Kushner and Y. N. Chen. Optimal control of assignment of jobs to processors under heavy traffic. \em Stochastics and Stochastics Rep. 68 (2000), no. 3-4, pp. 177--228.
A. Mandelbaum and A. L. Stolyar. Scheduling flexible servers with convex delay costs: heavy-traffic optimality of the generalized c-mu-rule. to appear in Operations Research.
A. L. Stolyar. Maxweight scheduling in a generalized switch: state space collapse and workload minimization in heavy traffic. To appear in Annals of Applied Probability.
R. J. Williams. On dynamic scheduling of a parallel server system with complete resource pooling. In Analysis of Communication Networks: Call Centres, Traffic and Performance, D. R. McDonald and S. R. E. Turner (eds.), American Mathematical Society, Providence, RI, 2000, 49-71.
Back to Workshop home page .