To pool or not to pool in call centers

Production and Operations Management

Volumn 17, Issue 3, 2008, Pages 296-305

  Van Dijk, Nico M ^a   Van Der Sluis, Erik ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Call centers; Overflow; Pooling; Queueing; Thresholds

Indexed keywords

EID: 48249090096     PISSN: 10591478     EISSN: None     Source Type: Journal    
DOI: 10.3401/poms.1080.0029     Document Type: Article

References (19)

1. Aksin, Z., M. Armory, V. Mehrotra. 2007. The modern call center: A multi-disciplinary perspective on operations management research. Production Oper. Management 16(6) 665-688.
2. Bell, S. L., R. J. Williams. 2001. Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy. Ann. Appl. Probab. 11(3) 608-649.
3. Borst, S. C., P. F. Seri. 1997. Robust algorithms for sharing agents with multiple skills. Technical Memorandum BL011212-970912-16TM, Bell Laboratories, Lucent Technologies, Murray Hill, NJ.
4. Borst, S. C., A. Mandelbaum, M. I. Reiman. 2004. Dimensioning large call centers. Oper. Res. 52(1) 17-34.
5. Cattani, K., G. M. Schmidt. 2005. The pooling principle. INFORMS Trans. Ed. 5(2). http://ite.pubs.informs.org/Vol5No2/Cattani Schmidt/.
6. Chevalier, P., N. Tabordon. 2003. Overflow analysis and cross-trained servers. Internat. J. Production Res. 85(1) 47-60.
7. Cooper, R. B. 1981. Introduction to Queueing Theory. North-Holland, Amsterdam.
8. Cosmetatos, G. P. 1976. Some approximate equilibrium results for the multi-server queue M/G/r. Oper. Res. Quart. 27(3) 615-620.
9. Gans, N., G. Koole, A. Mandelbaum. 2003. Telephone call centers: Tutorial, review and research prospects. Manufacturing Service Oper. Management 5(2) 79-141.
10. Harchol-Balter, M., T. Osogami, A. Scheller-Wolf. 2005. Robustness of threshold policies in beneficiary-donor model. SIGMETRICS Performance Eval. Rev. 33(2) 36-38.
11. Larson, R. C. 1987. Perspectives on queues: Social justice and the psychology of queueing. Oper. Res. 35(6) 895-905.
12. Mandelbaum, A., M. I. Reiman. 1998. On pooling in queueing networks. Management Sci. 44(7) 971-981.
13. Rothkopf, M. H., P. Rech. 1987. Perspectives on queues: Combining queues is not always beneficial. Oper. Res. 35(6) 906-909.
14. Sisselman, M. E., W. Whitt. 2007. Value-based routing and preference-based routing in customer contact centers. Production Oper. Management 16(3) 277-291.
15. Smith, D. R., W. Whitt. 1981. Resource sharing for efficiency in traffic systems. Bell System Tech. J. 60(1) 39-55.
16. Stanford, D. A., W. K. Grassmann. 1993. The bilingual server systems: A queueing model featuring fully and partially qualified servers. INFOR 31(4) 261-277.
17. Tijms, H. C. 1994. Stochastic Models: An Algorithmic Approach. Wiley, Chichester, UK.
18. Wallace, R. B., W. Whitt. 2005. A staffing algorithm for call centers with skill-based routing. Manufacturing Service Oper. Management 7(4) 276-294.
19. Wolff, R. W. 1989. Stochastic Modelling and the Theory of Queues. Prentice-Hall, Englewood Cliffs, NJ.