A Call-Routing Problem with Service-Level Constraints

References

• Akşin O. Z., Harker P. T. Modeling a phone center: Analysis of a multi-channel, multi-resource processor-shared loss system. Management Sci. (2001) 47:324–336Link, Google Scholar
• Altman E., Schwartz A. Markov decision problems and state-action frequencies. SIAM J. Control Optimiz. (1991) 29:786–809Crossref, Google Scholar
• Altman E., Jimenez T., Koole G. On optimal call admission control. IEEE Trans. Commun. (1998) 49:1659–1668Crossref, Google Scholar
• Armony M., Maglaras C. On customer contact centers with a call-back option: customer decisions, sequencing rules, and system design. Oper. Res. (2003) . to appearGoogle Scholar
• Avaya Communications Blending: The changing color of contact center productivity. (2001) . Retrieved September 9 〈 http://www1.avaya.com/enterprise/whitepapers/gcc0910.pdf〉Google Scholar
• Berman O., Larson R. C. A queuing control model for retail services having backroom operations and cross-trained workers. (2000) . Working paper, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
• Beutler F. J., Ross K. W. Optimal policies for controlled Markov chains with a constraint. J. Math. Anal. Appl. (1985) 112:236–252Crossref, Google Scholar
• Bhulai S., Koole G. A queueing model for call blending in call centers. IEEE Trans. Auto. Control (2000) . to appearGoogle Scholar
• Blanc J., de Waal P., Nain P., Towsley D. Optimal control of admission to a multiserver queue with two arrival streams. IEEE Trans. Auto. Control (1992) 37:785–797Crossref, Google Scholar
• Bolotin V. A. Telephone circuit holding time distributions. Proc. 14th International Teletraffic Conference (1994) (Antibes Juan-les-Pins, France) 125–134Crossref, Google Scholar
• Borst S., Mandelbaum A., Reiman M. I. Dimensioning large call centers. (2000) . Working paper, Technion, Haifa, IsraelGoogle Scholar
• Brandt A., Brandt M. On a two-queue priority system with impatience and its application to a call center. Methodology Comput. Appl. Probab. (1999) 1:191–210Crossref, Google Scholar
• Brown L., Gans N., Mandelbaum A., Sakov A., Shen H., Zeltyn S., Zhao L. Statistical analysis of a telephone call center: A queueing-science perspective. (2002) . Working paper, The Wharton School, University of Pennsylvania, Philadelphia, PAGoogle Scholar
• Carr S., Duenyas I. Optimal admission control and sequencing in a make-to-stock/make-to-order production system. Oper. Res. (2000) 48(5):709–720Link, Google Scholar
• Durrett R.Probability: Theory and Examples (1996) (Duxbury Press, Belmont, MA) Google Scholar
• Fleischer J. One hundred cool things about call centers. CallCenter Magazine (2000) OctoberGoogle Scholar
• Gans N., Zhou Y.-P. Managing learning and turnover in employee staffing. Oper. Res. (2002) 50(6):991–1006Link, Google Scholar
• Garnett O., Mandelbaum A., Reiman M. I. Designing a call-center with impatient customers. Manufacturing Service Oper. Management (2002) 4(3):208–227Link, Google Scholar
• Genesys Telecommunications Laboratories Genesys' universal queue2 model for integrated media channels. (2001) . Retrieved September 9 〈 http://www.genesyslab.com/contact_center/solutions/universal_queue2.html〉Google Scholar
• Green L. V., Kolesar P. J., Soares J. Improving the SIPP approach for staffing service systems that have cyclic demands. Oper. Res. (2001) 49(4):549–564Link, Google Scholar
• Guèrin R. Queueing-blocking system with two arrival streams and guard channels. IEEE Trans. Comm. (1998) 36:153–163Crossref, Google Scholar
• Halfin S., Whitt W. Heavy-traffic limits for queues with many exponential servers. Oper. Res. (1981) 29:567–588Link, Google Scholar
• Jennings O. B., Mandelbaum A., Massey W. A., Whitt W. Server staffing to meet time-varying demand. Management Sci. (1996) 42(10):1383–1394Link, Google Scholar
• Karlin S., Taylor H. M.A First Course in Stochastic Processes (1975) 2nd ed.(Academic Press, San Diego, CA) Google Scholar
• Kleinrock L.Queueing Systems (1975) 1(John Wiley and Sons, New York) Google Scholar
• Mandelbaum A. (2001) . Private communicationGoogle Scholar
• Mandelbaum A., Sakov A., Zeltyn S. Empirical analysis of a call center. (2000) . Working paper, Technion, Haifa, IsraelGoogle Scholar
• Örmeci E., Burnetas A., van der Waal J. Admission policies to a two-class loss system. Comm. Statist.: Stochast. Models (2000) 17(4):513–539Crossref, Google Scholar
• Pinedo M., Seshadri S., Shanthikumar J. G., Melnick E. L., Nayyar P. R., Pinedo M. L., Seshadri S. Call centers in financial services: Strategy, technology, and operations. Creating Value in Financial Services (2000) (Kluwer Academic Publishers, Boston, MA) Crossref, Google Scholar
• Puhalskii A. A., Reiman M. I. The multiclass GI/PH/N queue in the Halfin-Whitt regime. Advances Appl. Probab. (2000) 32:564–595Crossref, Google Scholar
• Puterman M. L.Markov Decision Processes: Discrete Stochastic Dynamic Programming (1994) (John Wiley and Sons, New York) Crossref, Google Scholar
• Savin S., Cohen M., Gans N., Katalan Z. Capacity management in rental businesses with heterogeneous customer bases. (2000) . Working paper, OPIM Department, The Wharton School, University of Pennsylvania, Philadelphia, PAGoogle Scholar
• Schaack C., Larson R. C. An N-server cutoff priority queue. Oper. Res. (1986) 34(2):257–266Link, Google Scholar
• Sennott L. I. Computing average optimal constrained policies in stochastic dynamic programming. Probab. Engrg. Information Sci. (2001) 15:103–133Crossref, Google Scholar
• Wolff R. W.Stochastic Modeling and the Theory of Queues (1989) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar