Many-server diffusion limits for G/Ph/n+GI queues

Karlin, S. and Taylor, H. M. (1981). <i>A Second Course in Stochastic Processes</i>. Academic Press, New York.

Billingsley, P. (1999). <i>Convergence of Probability Measures</i>, 2nd ed. Wiley, New York.

Ethier, S. N. and Kurtz, T. G. (1986). <i>Markov Processes</i>: <i>Characterization and Convergence</i>. Wiley, New York.

Johnson, D. P. (1983). Diffusion approximations for optimal filtering of jump processes and for queueing networks. Ph.D. thesis, Univ. Wisconsin.

Kang, W. N. and Ramanan, K. (2010). Fluid limits of many-server queues with reneging. <i>Ann. Appl. Probab.</i> To appear.

Kaspi, H. and Ramanan, K. (2010). Law of large numbers limits for many server queues. <i>Ann. Appl. Probab.</i> To appear.

Latouche, G. and Ramaswami, V. (1999). <i>Introduction to Matrix Analytic Methods in Stochastic Modeling</i>. SIAM, Philadelphia, PA.

Tezcan, T. (2006). State space collapse in many server diffusion limits of parallel server systems and applications. Ph.D. thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology.

Whitt, W. (2002). <i>Stochastic-Process Limits</i>. Springer, New York.

Zhang, J. (2009). Limited processor sharing queues and multi-server queues. Ph.D. thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology.

Garnett, O., Mandelbaum, A. and Reiman, M. (2002). Designing a call center with impatient customers. <i>Manufacturing and Service Operations Management</i> <b>4</b> 208–227.

Halfin, S. and Whitt, W. (1981). Heavy-traffic limits for queues with many exponential servers. <i>Oper. Res.</i> <b>29</b> 567–588.

Stone, C. (1963). Limit theorems for random walks, birth and death processes, and diffusion processes. <i>Illinois J. Math.</i> <b>7</b> 638–660.

Reiman, M. I. (1984). Open queueing networks in heavy traffic. <i>Math. Oper. Res.</i> <b>9</b> 441–458.

Iglehart, D. L. and Whitt, W. (1970). Multiple channel queues in heavy traffic. I. <i>Adv. in Appl. Probab.</i> <b>2</b> 150–177.

Borovkov, A. A. (1967). On limit laws for service processes in multi-channel systems. <i>Sibirsk. Mat. J.</i> <b>8</b> 746–763.

Dai, J. G. and He, S. (2010). Customer abandonment in many-server queues. <i>Math. Oper. Res.</i> <b>35</b> 347–362.

Dai, J. G. and Tezcan, T. (2005). State space collapse in many-server diffusion limits of parallel server systems in many-server limits. Preprint. Available at <a href="http://www2.isye.gatech.edu/~dai/publications/ssc_mor100324.pdf">http://www2.isye.gatech.edu/~dai/publications/ssc_mor100324.pdf</a>.

Dai, J. G. and Tezcan, T. (2008). Optimal control of parallel server systems with many servers in heavy traffic. <i>Queueing Syst.</i> <b>59</b> 95–134.

Gamarnik, D. and Momčilović, P. (2008). Steady-state analysis of a multiserver queue in the Halfin–Whitt regime. <i>Adv. in Appl. Probab.</i> <b>40</b> 548–577.

Jelenković, P., Mandelbaum, A. and Momčilović, P. (2004). Heavy traffic limits for queues with many deterministic servers. <i>Queueing Syst.</i> <b>47</b> 53–69.

Kiefer, J. and Wolfowitz, J. (1955). On the theory of queues with many servers. <i>Trans. Amer. Math. Soc.</i> <b>78</b> 1–18.

Mandelbaum, A., Massey, W. A. and Reiman, M. I. (1998). Strong approximations for Markovian service networks. <i>Queueing Syst.</i> <b>30</b> 149–201.

Mandelbaum, A. and Momčilović, P. (2009). Queues with many servers and impatient customers. Preprint. Available at <a href="http://iew3.technion.ac.il/serveng/References/MM0309.pdf">http://iew3.technion.ac.il/serveng/References/MM0309.pdf</a>.

Mandelbaum, A. and Pats, G. (1998). State-dependent stochastic networks. I. Approximations and applications with continuous diffusion limits. <i>Ann. Appl. Probab.</i> <b>8</b> 569–646.

Pang, G., Talreja, R. and Whitt, W. (2007). Martingale proofs of many-server heavy-traffic limits for Markovian queues. <i>Probab. Surv.</i> <b>4</b> 193–267.

Puhalskii, A. A. and Reed, J. E. (2010). On many-server queues in heavy traffic. <i>Ann. Appl. Probab.</i> <b>20</b> 129–195.

Puhalskii, A. A. and Reiman, M. I. (2000). The multiclass <i>GI</i>/<i>PH</i>/<i>N</i> queue in the Halfin–Whitt regime. <i>Adv. in Appl. Probab.</i> <b>32</b> 564–595.

Reed, J. (2009). The <i>G</i>/<i>GI</i>/<i>N</i> queue in the Halfin–Whitt regime. <i>Ann. Appl. Probab.</i> <b>19</b> 2211–2269.

Rogers, L. C. G. and Williams, D. (2000). <i>Diffusions</i>, <i>Markov Processes</i>, <i>and Martingales. Cambridge Mathematical Library</i> <b>2</b>. Cambridge Univ. Press, Cambridge.

Tezcan, T. and Dai, J. G. (2010). Dynamic control of <i>N</i>-systems with many servers: Asymptotic optimality of a static priority policy in heavy traffic. <i>Oper. Res.</i> <b>58</b> 94–110.

Whitt, W. (2004). Efficiency-driven heavy-traffic approximations for many-server queues with abandonments. <i>Manag. Sci.</i> <b>50</b> 1449–1461.

Whitt, W. (2005). Heavy-traffic limits for the <i>G</i>/<i>H</i>₂*/<i>n</i>/<i>m</i> queue. <i>Math. Oper. Res.</i> <b>30</b> 1–27.

Whitt, W. (2006). Fluid models for multiserver queues with abandonments. <i>Oper. Res.</i> <b>54</b> 37–54.

Whitt, W. (2007). Proofs of the martingale FCLT. <i>Probab. Surv.</i> <b>4</b> 268–302.