A call-routing problem with service-level constraints

Operations Research

Volumn 51, Issue 2, 2003, Pages 255-271

  Gans, Noah ^a   Zhou, Yong Pin ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Dynamic programming, infinite state Markov: average cost, constrained MDP; Queues, optimization: control of multiclass, Markovian systems

Indexed keywords

OPTIMAL POLICY PARAMETERS; PROCESSING RATES; SOFTWARE PACKAGES;

COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; CONSTRAINT THEORY; DECISION MAKING; DYNAMIC PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; QUEUEING THEORY; SOCIETIES AND INSTITUTIONS; TELECOMMUNICATION CONTROL;

QUEUEING NETWORKS;

EID: 0344579136     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.51.2.255.12787     Document Type: Article

References (35)

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