The cμ/θ rule for many-server queues with abandonment

Operations Research

Volumn 58, Issue 5, 2010, Pages 1427-1439

  Atar, Rami ^a   Giat, Chanit ^a   Shimkin, Nahum ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Customer abandonment; Fluid limits; Multiclass queue

Indexed keywords

ASYMPTOTICALLY OPTIMAL; CLASS I; CUSTOMER ABANDONMENT; FLUID LIMITS; FLUID SCALING; HOLDING COSTS; INDEX RULE; MULTI-CLASS QUEUEING SYSTEMS; MULTICLASS QUEUE; OVERLOAD CONDITION; SCHEDULING POLICIES; SERVER QUEUE; SERVICE RATES;

FLUIDS; OPTIMIZATION; QUEUEING THEORY; SALES; SERVERS;

CUSTOMER SATISFACTION;

EID: 77958499293     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1100.0826     Document Type: Article

References (28)

1. Aksin, Z., M. Armony, V. Mehrotra. 2007. The modern call center: A multi-disciplinary perspective on operations management research. Production Oper. Management 16(6) 665-688.
2. Armony, M., A. Mandelbaum. 2010. Design, staffing and control of large service systems: The case of a single customer class and multiple server types. Oper. Res. Forthcoming.
3. Atar, R., C. Giat, N. Shimkin. 2008. The cμ/θ rule. Proc. Valuetools, Athens.
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. Baras, J. S., D.-J. Ma, A. Makowski. 1985. K competing queues with geometric service requirements and linear costs: The //c-rule is always optimal. Systems Control Lett. 6(3) 173-180.
6. Bassamboo, A., J. M. Harrison, A. Zeevi. 2006a. Design and control of a large call center: Asymptotic analysis of an LP-based method. Oper. Res. 54(3) 419-435.
7. Bassamboo, A., J. M. Harrison, A. Zeevi. 2006b. Dynamic routing and admission control in high volume service systems: Asymptotic analysis via multi-scale fluid limits. Queueing Systems 51(3-4) 249-285.
8. Birkhoff, G., G. C. Rota. 1989. Ordinary Differential Equations, 4th ed. John Wiley & Sons, New York.
9. Brémaud, P. 1981. Point Processes and Queues. Springer, New York.
10. Chen, H., D. Yao. 2001. Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization. Springer, New York.
11. Cox, D. R., W. L. Smith. 1961. Queues. Methuen, London.
12. Gans, N., G. Koole, A. Mandelbaum. 2003. Telephone call centers: Tutorial, review, and research prospects. Manufacturing Service Oper. Management 5(2) 79-141.
13. Hirayama, T., M. Kijima, S. Nishimura. 1989. Further results for dynamic scheduling of multiclass G/G/l queues. J. Appl. Probab. 26 595-603.
14. Kang, W., K. Ramanan. 2010. Fluid limits of many-server queues with reneging. Ann. Appl. Probab. Forthcoming.
15. Kaspi, H., K. Ramanan. 2010. Law of large numbers limits for many- server queues. Ann. Appl. Probab. Forthcoming.
16. Klimov, G. P. 1974. Time-sharing service systems. I. Theory Probab. Appl. 19(3) 532-551.
17. Mandelbaum, A., A. L. Stolyar. 2004. Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized cμ -rule. Oper. Res. 52(6) 836-855.
18. Mandelbaum, A., W. A. Massey, M. I. Reiman. 1998. Strong approximations for Markovian service networks. Queueing Systems 30(1-2) 149-201.
19. Nain, P., D. Towsley. 1994. Optimal scheduling in a machine with stochastic varying processing rate. IEEE Trans. Automatic Control 39(9) 1853-1855.
20. Perry, O., W. Whitt. 2009. A fluid approximation for service systems responding to unexpected overloads. Preprint.
21. Reed, J. E. 2010. The G/GI/N queue in the Halfin-Whitt regime. Ann. Appl. Probab. Forthcoming.
22. Rozenshmidt, L. 2007. On priority queues with impatient customers: Stationary and time-varying analysis. Ph.D. thesis, Technion, Haifa, Israel.
23. Smith, W. E. 1956. Various optimizers for single-stage production. Naval Res. Logist. Quart. 3 59-66.
24. Van Mieghem, J. A. 1995. Dynamic scheduling with convex delay costs: The generalized cμ rule. Ann. Appl. Probab. 5(3) 809-833.
25. Van Mieghem, J. A. 2003. Due-date scheduling: Asymptotic optimality of generalized longest queue and generalized largest delay rules. Oper. Res. 51(1) 113-122.
26. Walrand, J., C. Buyukkoc, P. Varaiya. 1985. The cμ -rule revisited. Adv. Appl. Probab. 17 237-238.
27. Whitt, W. 2004. Efficiency-driven heavy-traffic approximations for many-server queues with abandonments. Management Sci. 50(10) 1449-1461.
28. Whitt, W. 2006. Fluid models for multiserver queues with abandonments. Oper. Res. 54(1) 37-54.