Efficient routing in heavy traffic under partial sampling of service times

Mathematics of Operations Research

Volumn 33, Issue 4, 2008, Pages 899-909

  Atar, Rami ^a   Shwartz, Adam ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Halfin whitt regime; Routing policies; Service time sampling

Indexed keywords

NETWORK ROUTING;

ARRIVAL RATES; COMPLETE INFORMATIONS; CRITICAL LOADING CONDITIONS; EFFICIENT ROUTING; EMPIRICAL DISTRIBUTIONS; EXPONENTIAL SERVERS; HALFIN-WHITT REGIME; HEAVY TRAFFICS; RENEWAL ARRIVALS; ROUTING MECHANISMS; ROUTING POLICIES; SERVICE RATES; SERVICE TIME DISTRIBUTIONS; SERVICE TIME SAMPLING; SINGLE SAMPLES;

SERVERS;

EID: 61449174717     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1080.0325     Document Type: Article

References (16)

1. Armony, M. 2005. Dynamic routing in large-scale service systems with heterogeneous servers. Queueing Systems 51(3-4) 287-329.
2. Atar, R. 2005. Scheduling control for queueing systems with many servers: Asymptotic optimality in heavy traffic. Ann. Appl. Probab. 15(4) 2606-2650.
3. Atar, R. 2008. Central limit theorem for a many-server queue with random service rates. Ann. Appl. Probab. 18(4) 1548-1568.
4. Atar, R., A. Mandelbaum., M. I. Reiman. 2004. Scheduling a multi class queue with, many exponential servers: Asymptotic optimality in heavy traffic. Ann. Appl. Probab. 14(3) 1084-1134.
5. Atar, R., A. Mandelbaum, G. Shaikhet. Simplified control problems for multi-class many-server queueing systems. Preprint.
6. Bassamboo, A., J. M. Harrison, A. Zeevi. 2006. Design and control of a large call center: Asymptotic analysis of an LP-based method. Oper. Res. 54(3) 419-435.
7. Billingsley, P. 1999. Convergence of Probability Measures, 2nd ed. John Wiley and Sons, New York.
8. Gans, N., G. Koole, A. Mandelbaum. 2003. Telephone call centers: Tutorial, review, and research prospects. Manufacturing Service Oper: Management 5(2) 79-141.
9. Gurvich, I., W. Whitt. Scheduling flexible servers with, convex delay costs in many-server service systems. Manufacturing Service Oper. Management. Forthcoming.
10. Halfln, S., W. Whitt. 1981. Heavy-traffic limits for queues with many exponential servers. Oper: Res. 29(3) 567-588.
11. Kaspi, H., K. Ramanan. Fluid limits for the GI/GI/N queue. Preprint.
12. Mitzenmacher, M., A. W. Richa, R. Sitaraman. 200.1. The power of two random choices: A survey of techniques and results. Handbook of Randomized Computing, Vol. I, II. Comb. Optim., 9. Kluwer Academic Publ., Dordrecht, The Netherlands, 255-312.
13. Pang, G., R. Talreja, W. Whitt. 2007. Martingale proofs of many-server heavy-traffic limits for Markovian queues. Probab. Surveys 4 193-267.
14. Reed, J. E. The G/GI/N queue in the Halfin-Whitt regime. Preprint.
15. Tezcan, T. Asymptotically optimal control of many-server heterogeneous service systems with hyper-exponential service times. Preprint.
16. Tezcan, T., J. Dai. Dynamic control of N-systems with many servers: Asymptotic optimality of a static priority policy in heavy traffic. Preprint.