Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy

Annals of Applied Probability

Volumn 11, Issue 3, 2001, Pages 608-649

  Bell, S L ^a   Williams, R J ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Brownian control problem; Diffusion approximations; Dynamic control; Heavy traffic; Large deviations; Queueing networks; Resource pooling

Indexed keywords

EID: 0035413555     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1015345343     Document Type: Article

References (37)

1. BILLINGSLEY, P. (1968). Convergence of Probability Measures. Wiley, New York.
2. BRAMSON, M. (1996). Convergence to equilibria for fluid models of FIFO queueing networks. Queueing Systems 22 5-45.
3. CHEN, H. and MANDELBAUM, A. (1991). Leontief Systems, RBV's and RBM's. In Applied Stochastic Analysis (M. H. A. Davis and R. J. Elliott, eds.) 1-43. Gordon and Breach, New York.
4. CHEVALIER, P. B. and WEIN, L. (1993). Scheduling networks of queues: heavy traffic analysis of a multistation closed network. Operations Research 41 743-758.
5. DEMBO, A. and ZEITOUNI, O. (1998). Large Deviations Techniques and Applications, 2nd ed. Springer, New York.
6. ETHIER, S. N. and KURTZ, T. G. (1986). Markov Processes: Characterization and Convergence. Wiley, New York.
7. HARRISON, J. M. (1985). Brownian Motion and Stochastic Flow Systems. Wiley, New York.
8. HARRISON, J. M. (1988). Brownian models of queueing networks with heterogeneous customer populations. In Stochastic Differential Systems, Stochastic Control Theory and Their Applications (W. Fleming and P. L. Lions, eds.) 147-186. Springer, New York.
9. HARRISON, J. M. (1996). The BIGSTEP approach to flow management in stochastic processing networks. In Stochastic Networks: Theory and Applications (F. P. Kelly, S. Zachary and I. Ziedins, eds.) 57-90. Oxford Univ. Press.
10. HARRISON, J. M. (1998). Heavy traffic analysis of a system with parallel servers: asymptotic optimality of discrete-review policies. Ann. Appl. Probab. 8 822-848.
11. HARRISON, J. M. (2000). Brownian models of open processing networks: canonical representation of workload. Ann. Appl. Probab. 10 75-103.
12. HARRISON, J. M. and LÓPEZ, M. J. (1999). Heavy traffic resource pooling in parallel-server systems. Queueing Systems 33 339-368.
13. HARRISON, J. M. and VAN MIEGHEM, J. A. (1997). Dynamic control of Brownian networks: state space collapse and equivalent workload formulations. Ann. Appl. Probab. 7 747-771.
14. HARRISON, J. M. and WEIN, L. (1989). Scheduling networks of queues: heavy traffic analysis of a simple open network. Queueing Systems 5 265-280.
15. HARRISON, J. M. and WEIN, L. (1990). Scheduling networks of queues: heavy traffic analysis of a two-station closed network. Oper. Res. 38 1052-1064.
16. IGLEHART, D. L. and WHITT, W. (1971). The equivalence of functional central limit theorems for counting processes and associated partial sums. Ann. Math. Statist. 42 1372-1378.
17. JORDAN, W. C. and GRAVES, C. (1995). Principles on the benefits of manufacturing process flexibility. Management Sci. 41 577-594.
18. KELLY, F. P. and LAWS, C. N. (1993). Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling. Queueing Systems 13 47-86.
19. KUMAR, S. (2000). Two-server closed networks in heavy traffic: diffusion limits and asymptotic optimality. Ann. Appl. Probab. 10 930-961.
20. KUSHNER, H. J. and CHEN, Y. N. (2000). Optimal control of assignment of jobs to processors under heavy traffic. Stochastics Stochastics Rep. 68 177-228.
21. KUSHNER, H. J. and DUPUIS, P. (1992). Numerical Methods for Stochastic Control Problems in Continuous Time. Springer, New York.
22. KUSHNER, H. J. and MARTINS, L. F. (1990). Routing and singular control for queueing networks in heavy traffic. SIAM J. Control Optim. 28 1209-1233.
23. KUSHNER, H. J. and MARTINS, L. F. (1996). Heavy traffic analysis of a controlled multi-class queueing network via weak convergence methods. SIAM J. Control Optim. 34 1781-1797.
24. LAWS, C. N. (1992). Resource pooling in queueing networks with dynamic routing. Adv. Appl. Probab. 24 699-726.
25. LAWS, C. N. and LOUTH, G. M. (1990). Dynamic scheduling of a four-station queueing network. Probab. Engrg. Inform. Sci. 4 131-156.
26. MARTINS, L. F., SHREVE, S. E. and SONER, H. M. (1996). Heavy traffic convergence of a controlled, multi-class queueing system. SIAM J. Control Optim. 34 2133-2171.
27. MITRANI, I. (1998). Probabilistic Modelling. Cambridge Univ. Press.
28. PETERSON, W. P. (1991). A heavy traffic limit theorem for networks of queues with multiple customer types. Math. Oper. Res. 16 90-118.
29. PUHALSKII, A. A. and REIMAN, M. I. (1998). A critically loaded multirate link with trunk reservation. Queueing Systems 28 157-190.
30. ROCKAFELLAR, R. T. (1970). Convex Analysis. Princeton Univ. Press.
31. ROUGHAN, M. and PEARCE, C. E. M. (2000). A martingale analysis of hysteretic overload control. Advances in Performance Analysis 3 1-30.
32. TEH, Y. C. (1999). Threshold routing strategies for queueing networks. D.Phil, thesis, Univ. Oxford.
33. VAN MIEGHEM, J. A. (1995). Dynamic scheduling with convex delay costs: the generalized cμ rule. Ann. Appl. Probab. 5 808-833.
34. WEIN, L. (1990). Scheduling networks of queues: heavy traffic analysis of a two-station network with controllable inputs. Oper. Res. 38 1065-1078.
35. WILLIAMS, R. J. (1998). An invariance principle for semimartingale reflecting Brownian motions in an orthant. Queueing Systems 30 5-25.
36. WILLIAMS, R. J. (1998). Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse. Queueing Systems 30 27-88.
37. WILLIAMS, R. J. (2000). 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.) 49-71. Amer. Math. Soc., Providence, RI.