Staffing and Control of Instant Messaging Contact Centers

References

• 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
• Bassamboo A, Harrison JM, Zeevi A. Design and control of a large call center: Asymptotic analysis of an LP-based method. Oper. Res. (2006) 54(3):419–435Link, Google Scholar
• Borst S, Mandelbaum A, Reiman MI. Dimensioning large call centers. Oper. Res. (2004) 52(1):17–34Link, Google Scholar
• Coffman EG, Puhalskii AA, Reiman MI. Polling systems with zero switchover times: A heavy-traffic averaging principle. Ann. Appl. Probab. (1995) 5(3):681–719Crossref, Google Scholar
• Coffman EG, Puhalskii AA, Reiman MI. Polling systems in heavy traffic: A Bessel process limit. Math. Oper. Res. (1998) 23(2):257–304Link, Google Scholar
• Ethier SN, Kurtz TG. Markov Processes: Characterization and Convergence (1986) (John Wiley & Sons, Inc., New York) Wiley Series in Probability and StatisticsCrossref, Google Scholar
• Feldman Z, Mandelbaum A, Massey WA, Whitt W. Staffing of time-varying queues to achieve time-stable performance. Management Sci. (2008) 54(2):324–338Link, 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
• George JM, Harrison JM. Dynamic control of a queue with adjustable service rate. Oper. Res. (2001) 49(5):720–731Link, Google Scholar
• Gupta V, Zhang J. Limited processor sharing queues with state dependent service rates. (2011) . Technical report, The Hong Kong University of Science and Technology, Hong KongGoogle Scholar
• Hunt PJ, Kurtz TG. Large loss networks. Stochastic Processes and Their Appl. (1994) 53(2):363–378Crossref, Google Scholar
• Kleinrock L. Queueing systems. Computer Applications (1976) 2(Wiley-Interscience, New York) Google Scholar
• Kurtz TG. Averaging for martingale problems and stochastic approximation. Applied Stochastic Analysis (1992) 177(Springer, Berlin) 186–209Lecture Notes in Control and Information SciencesCrossref, Google Scholar
• Mandelbaum A, Massey WA, Reiman MI. Strong approximations for Markovian service networks. Queueing Systems (1998) 30(1–2):149–201Crossref, 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. Diffusion approximation for an overloaded X model via an averaging principle. (2011a) . Working paper, Columbia University, New YorkGoogle Scholar
• Perry O, Whitt W. A fluid approximation for service systems responding to unexpected overloads. Oper. Res. (2011b) 59(5):1159–1170Link, Google Scholar
• Perry O, Whitt W. An ODE for an overloaded X model involving a stochastic averaging principle. Stochastic Systems (2011c) 1:17–66Crossref, Google Scholar
• Perry O, Whitt W. A fluid limit for an overloaded X model via a stochastic averaging principle. Math. Oper. Res. (2012) . ePub ahead of print December 20, http://dx.doi.org/10.1287/moor.1120.0572Google Scholar
• Puhalskii A. The Mt/Mt/Kt + Mt queue in heavy traffic. (2008) . http://arxiv.org/pdf/0807.4621.pdfGoogle Scholar
• Ritchie DM, Thompson K. The UNIX time-sharing system. J. ACM (1974) 17(7):365–375Crossref, Google Scholar
• Shae Z-Y, Garg D, Bhose R, Mukherjee R, Guven S, Pingali G. Efficient Internet chat services for help desk agents. IEEE Internat. Conf. Services Comput., SCC 2007 (2007) (IEEE, Piscataway, NJ) 589–596Crossref, Google Scholar
• Tezcan T. Design and control of customer service chat systems. (2011) . Technical report, University of Rochester, Rochester, NYGoogle Scholar
• Whitt W. Stochastic-Process Limits (2002) (Springer-Verlag, New York) Springer Series in Operations ResearchCrossref, Google Scholar
• Whitt W. Fluid models for multiserver queues with abandonments. Oper. Res. (2006) 54(1):37–54Link, Google Scholar
• Zhang J, Zwart B. Steady state approximations of limited processor sharing queues in heavy traffic. Queueing Systems (2008) 60(3–4):227–246Crossref, Google Scholar
• Zhang J, Dai JG, Zwart B. Law of large number limits of limited processor-sharing queues. Math. Oper. Res. (2009) 34(4):937–970Link, Google Scholar
• Zhang J, Dai JG, Zwart B. Diffusion limits of limited processor-sharing queues. Ann. Appl. Probab. (2011) 21(2):745–799Crossref, Google Scholar