论文信息 - Heavy traffic analysis of a system with parallel servers: asymptotic optimality of discrete-review policies - 字舞流文

Heavy traffic analysis of a system with parallel servers: asymptotic optimality of discrete-review policies

[1] P. Billingsley,et al. Convergence of Probability Measures , 1969 .

[2] J. Michael Harrison. The supremum distribution of a Lévy process with no negative jumps , 1977, Advances in Applied Probability.

[3] Martin I. Reiman,et al. Open Queueing Networks in Heavy Traffic , 1984, Math. Oper. Res..

[4] Martin I. Reiman,et al. Some diffusion approximations with state space collapse , 1984 .

[5] J. Michael Harrison,et al. Brownian Models of Queueing Networks with Heterogeneous Customer Populations , 1988 .

[6] Lawrence M. Wein,et al. Scheduling networks of queues: Heavy traffic analysis of a simple open network , 1989, Queueing Syst. Theory Appl..

[7] Martin I. Reiman,et al. A network of priority queues in heavy traffic: One bottleneck station , 1990, Queueing Syst. Theory Appl..

[8] Lawrence M. Wein,et al. Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network , 1990, Oper. Res..

[9] Lawrence M. Wein. Brownian Networks with Discretionary Routing , 1991, Oper. Res..

[10] Lawrence M. Wein,et al. Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Closed Network , 1993, Oper. Res..