Network of time-varying many-server fluid queues with customer abandonment

Operations Research

Volumn 59, Issue 4, 2011, Pages 835-846

  Liu, Yunan ^a   Whitt, Ward ^a  

^a Department of Earth and Environmental Sciences   (United States)

Author keywords

Customer abandonment; Deterministic fluid model; Many server queues; Non Markovian queues; Queueing networks; Queues; Time varying arrivals

Indexed keywords

CUSTOMER ABANDONMENT; DETERMINISTIC FLUID MODEL; MANY-SERVER QUEUES; NON-MARKOVIAN; QUEUES; TIME VARYING;

ALGORITHMS; CUSTOMER SATISFACTION; FLUIDS; NETWORK ROUTING; QUEUEING NETWORKS; SALES; TIME VARYING NETWORKS; TIME VARYING SYSTEMS;

QUEUEING THEORY;

EID: 80053274085     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1110.0942     Document Type: Article

References (20)

1. Aksin, Z., M. Armony, V. Mehrotra. 2007. The modern call center: A multi-disciplinary perspective on operations management research. Production Oper. Management 16 (6) 665-688.
2. Buzacott, J. A., J. G. Shanthikumar. 1992. Stochastic Models of Manufacturing Systems. Prentice Hall, Englewood Cliffs, NJ.
3. Chen, H., A. Mandelbaum. 1991. Discrete flow networks: Bottleneck analysis and fluid approximations. Math. Oper Res. 16 (2) 408-446.
4. Chen, H., D. D. Yao. 2001. Fundamentals of Queueing Networks. Springer, New York.
5. Feldman, Z., A. Mandelbaum, W. A. Massey, W. Whitt. 2008. Staffing of time-varying queues to achieve time-stable performance. Management Sci. 54 (2) 324-338. (Pubitemid 351463147)
6. Garnett, O., A. Mandelbaum, M. Reiman. 2002. Designing a call center with impatient customers. Manufacturing Service Oper. Management 4 (3) 208-227.
7. Goodman, J. B., W. A. Massey. 1984. The non-ergodic Jackson network. J. Appl. Probab. 21 (4) 860-869.
8. Green, L. V., P. J. Kolesar, W. Whitt. 2007. Coping with time-varying demand when setting staffing requirements for a service system. Production Oper Management 16 (1) 13-39.
9. t + GI many-server fluid queue. Working paper, Columbia University, New York, http://www.columbia.edu/~ww2040/allpapers.html.
10. Mandelbaum, A., W. A. Massey, M. I. Reiman. 1998. Strong approximations for Markovian service networks. Queueing Systems 30 (1-2) 149-201. (Pubitemid 128370856)
11. Massey, W. A., W Whitt. 1993. Networks of infinite-server queues with nonstationary Poisson input. Queueing Systems 13 (1-3) 183-250.
12. K queueing system: Part II-the multiclass network. INFORMS J. Comput. 16 (3) 275-283. (Pubitemid 39253170)
13. Newell, G. F. 1982. Applications of Queueing Theory, 2nd ed. Chapman and Hall, London.
14. Pang, G., W. Whitt. 2010. Two-parameter heavy-traffic limits for infiniteserver queues. Queueing Systems 65 (4) 325-364.
15. Pang, G., R. Talreja, W. Whitt. 2007. Martingale proofs of manyserver heavy-traffic limits for Markovian queues. Probab. Surveys 4 193-267.
16. Teschl, G. 2000. Ordinary Differential Equations and Dynamical Systems. Lecture Notes, University of Vienna, Vienna. Accessed July 2011, http://www.mat.univie.ac.at/~gerald/ftp/book-ode/.
17. Whitt, W 1983. The queueing network analyzer. Bell System Tech. J. 62 (9) 2779-2815.
18. Whitt, W 2002. Stochastic-Process Limits. Springer, New York.
19. Whitt, W. 2006. Fluid models for multiserver queues with abandonments. Oper Res. 54 (1) 37-54.
20. Yom-Tov, G., A. Mandelbaum. 2010. The Erlang-R queue: Time-varying QED queues with reentrant customers in support of healthcare staffing. Working paper, The Technion, Haifa, Israel.