Shadow-Routing Based Control of Flexible Multiserver Pools in Overload

References

• Aksin Z., Armony M., Mehrotra V. The modern call-center: A multi-disciplinary perspective on operations management research. Production Oper. Management (2007) 16(6):655–688Google Scholar
• Atar R. A diffusion model of scheduling control in queueing systems with many servers. Ann. Appl. Probab. (2005a) 15(1B):820–852Crossref, Google Scholar
• Atar R. Scheduling control for queueing systems with many servers: Asymptotic optimality in heavy traffic. Ann. Appl. Probab. (2005b) 15(4):2606–2650Crossref, Google Scholar
• Atar R., Giat C., Shimkin N. The cμ/θ rule for many-server queues with abandonment. Oper. Res. (2010) 58(5):1427–1439Link, Google Scholar
• Atar R., Giat C., Shimkin N. On the asymptotic optimality of the cμ/θ rule under ergodic cost. Queueing Systems (2011) 67(2):127–144Crossref, Google Scholar
• Atar R., Mandelbaum A., Reiman M. Scheduling a multi-class queue with many exponential servers: Asymptotic optimality in heavy-traffic. Ann. Appl. Probab. (2004) 14(3):1084–1134Crossref, Google Scholar
• Bassamboo A., Randhawa R. S. On the accuracy of fluid models for capacity sizing in queueing systems with impatient customers. Oper. Res. (2010) 58(5):1398–1413Link, Google Scholar
• Bassamboo A., Zeevi A. On a data-driven method for staffing large call centers. Oper. Res. (2009) 57(3):714–726Link, Google Scholar
• Bassamboo A., Harrison J. M., Zeevi A. Design and control of a large call center: Asymptotic analysis of an LP-based method. Oper. Res. (2006a) 54(3):419–435Link, Google Scholar
• Bassamboo A., Harrison J. M., Zeevi A. Dynamic routing and admission control in high-volume service systems: Asymptotic analysis via multi-scale fluid limits. Queueing Systems (2006b) 51(3–4):249–285Crossref, Google Scholar
• Bassamboo A., Randhawa R. S., Zeevi A. Capacity sizing under parameter uncertainty: Safety staffing principles revisited. Management Sci. (2010) 56(10):1668–1686Link, Google Scholar
• Dai J. G., Tezcan T. Dynamic control of parallel server systems in many server heavy traffic. Queueing Systems (2008) 59(2):95–134Crossref, Google Scholar
• Dai J. G., He S., Tezcan T. Many-server diffusion limits for G/Ph/n+GI queues. Ann. Appl. Probab. (2010) 20(5):1854–1890Crossref, Google Scholar
• Gans N., Koole G., Mandelbaum A. Telephone call centers: Tutorial, review and research prospects. Manufacturing Service Oper. Management (2003) 5(2):79–141Link, Google Scholar
• Gurvich I., Whitt W. Scheduling flexible servers with convex delay costs in many-server service systems. Manufacturing Service Oper. Management (2007) 11(2):237–253Link, Google Scholar
• Gurvich I., Whitt W. Service-level differentiation in many-server service systems via queue-ratio routing. Oper. Res. (2010) 58(2):316–328Link, Google Scholar
• Harrison J. M., Zeevi A. Dynamic scheduling of a multiclass queue in the Halfin-Whitt heavy traffic regime. Oper. Res. (2004) 52(2):243–257Link, Google Scholar
• Kang W., Ramanan K. Fluid limits of many-server queues with reneging. Ann. Appl. Probab. (2010) 20(6):2204–2260Crossref, Google Scholar
• Kaspi H., Ramanan K. Law of large numbers limits for many server queues. Ann. Appl. Probab. (2011) 21(1):33–114Crossref, Google Scholar
• Mandelbaum A., Stolyar A. Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized cμ-rule. Oper. Res. (2004) 52(6):836–855Link, Google Scholar
• Perry O., Whitt W. Responding to unexpected overloads in large-scale service systems. Management Sci. (2009) 55(8):1353–1367Link, Google Scholar
• Perry O., Whitt W. A fluid approximation for service systems responding to unexpected overloads. Oper. Res. (2011) 59(5):1159–1170Link, Google Scholar
• Reed J. The G/GI/N queue in the Halfin-Whitt regime. Ann. Appl. Probab. (2009) 19(6):2211–2269Crossref, Google Scholar
• Reed J. The G/GI/N queue in the Halfin-Whitt regime II: Idle time system equations. (2010) . Technical report, New York UniversityGoogle Scholar
• Shaikhet G. A fluid control problem in queueing networks with general service times. (2010) . Technical report, Carnegie Mellon University, PittsburghGoogle Scholar
• Shakkottai S., Stolyar A. L. Scheduling for multiple flows sharing a time-varying channel: The exponential rule. Analytic Methods Appl. Probab. Amer. Math. Soc. Translations, Ser. 2 (2002) 207:185–202Google Scholar
• Stolyar A. L. Maximizing queueing network utility subject to stability: Greedy primal-dual algorithm. Queueing Systems (2005a) 50(4):401–457Crossref, Google Scholar
• Stolyar A. L. Optimal routing in output-queued flexible server systems. Probab. Engrg. Inform. Sci. (2005b) 19(2):141–189Crossref, Google Scholar
• Stolyar A. L., Tezcan T. Control of systems with flexible multi-server pools: A shadow routing approach. Queueing Systems (2010) 66(1):1–51Crossref, Google Scholar
• Tezcan T., Dai J. G. Dynamic control of n-systems with many servers: Asymptotic optimality of a static priority policy in heavy traffic. Oper. Res. (2010) 58(1):94–110Link, Google Scholar
• Whitt W. Efficiency-driven heavy-traffic approximations for many-server queues with abandonments. Management Sci. (2004) 50(10):1449–1461Link, Google Scholar
• Whitt W. Fluid models for multiserver queues with abandonments. Oper. Res. (2006) 54(1):37–54Link, Google Scholar