Scheduling control for queueing systems with many servers: Asymptotic optimality in heavy traffic

Annals of Applied Probability - Tập 15 Số 4 - 2005
Rami Atar1
1Technion-Israel Institute of Technology

Tóm tắt

Từ khóa


Tài liệu tham khảo

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

Karatzas, I. and Shreve, S. E. (1991). <i>Brownian Motion and Stochastic Calculus</i>, 2nd ed. Springer, New York.

Bell, S. L. and Williams, R. J. (2001). Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy. <i>Ann. Appl. Probab.</i> <b>11</b> 608–649.

Gans, N., Koole, G. and Mandelbaum, A. (2003). Telephone call centers: Tutorial, review and research prospects. <i>Manufacturing and Service Operations Management</i> <b>5</b> 79–141.

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

Harrison, J. M. (2000). Brownian models of open processing networks: Canonical representation of workload. <i>Ann. Appl. Probab.</i> <b>10</b> 75–103.

Atar, R., Mandelbaum, A. and Reiman, M. (2004). Scheduling a multi-class queue with many exponential servers: Asymptotic optimality in heavy-traffic. <i>Ann. Appl. Probab.</i> <b>14</b> 1084–1134.

Harrison, J. M. and López, M. J. (1999). Heavy traffic resource pooling in parallel-server systems. <i>Queueing Systems Theory Appl.</i> <b>33</b> 339–368.

Ata, B. and Kumar, S. (2005). Heavy traffic analysis of open processing networks with complete resource pooling: Asymptotic optimality of discrete review policies. <i>Ann. Appl. Probab.</i> <b>15</b> 331–391.

Atar, R. (2005). A diffusion model of scheduling control in queueing systems with many servers. <i>Ann. Appl. Probab.</i> <b>15</b> 820–852.

Mandelbaum, A. and Reiman, M. I. Private communication.

Mandelbaum, A. and Stolyar, A. L. (2004). Scheduling flexible servers with convex delay costs: Heavy traffic optimality of the generalized $c\mu$ rule.\goodbreak <i>Oper. Res.</i> <b>52</b> 836–855.

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

Williams, R. J. (2000). On dynamic scheduling of a parallel server system with complete resource pooling. In <i>Analysis of Communication Networks<i>:</i> Call Centres<i>,</i> Traffic and Performance<i>.</i> Fields Inst. Commun.</i> <b>28</b> 49–71. Amer. Math. Soc., Providence, RI.