Stabilizing customer abandonment in many-server queues with time-varying arrivals

Operations Research

Volumn 60, Issue 6, 2012, Pages 1551-1564

  Liu, Yunan ^a   Whitt, Ward ^b  

^a North Carolina State University   (United States)

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

Author keywords

Capacity planning; Infinite server queues; Many server queues; Offered load approximations; Queues with abandonment; Queues with time varying arrivals; Service systems; Staffing

Indexed keywords

CAPACITY PLANNING; INFINITE-SERVER QUEUES; MANY-SERVER QUEUES; OFFERED-LOAD APPROXIMATIONS; QUEUES WITH ABANDONMENT; SERVICE SYSTEMS; STAFFING; TIME VARYING;

PERSONNEL SELECTION; PROBABILITY DISTRIBUTIONS;

QUEUEING THEORY;

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

References (25)

1. Billingsley P (1999) Convergence of Probability Measures, 2nd ed. (Wiley, New York).
2. Davis JL, Massey WA, Whitt W (1995) Sensitivity to the service-time distribution in the nonstationary Erlang loss model. Management Sci. 41(6):1107-1116.
3. t/G/∞ queue. Oper Res. 41(4):731-742.
4. t/G/∞ queues with sinusoidal arrival rates. Management Sci. 39(2):241-252.
5. Feldman Z, Mandelbaum A, Massey WA, Whitt W (2008) Staffing of time-varying queues to achieve time-stable performance. Management Sci. 54(2):324-338. (Pubitemid 351463147)
6. Feller W (1971) An Introduction to Probability Theory and Its Applications, 2nd ed. (Wiley, New York).
7. Garnett O, Mandelbaum A, Reiman M (2002) Designing a call center with impatient customers. Manufacturing Service Oper Management 4(3):208-227.
8. Green LV, Kolesar PJ, Whitt W (2007) Coping with time-varying demand when setting staffing requirements for a service system. Production Oper Management 16:13-39.
9. Jagerman DL (1975) Nonstationary blocking in telephone traffic. Bell System Tech. J. 54:625-661.
10. Jennings OB, Mandelbaum A, Massey WA, Whitt W (1996) Server staffing to meet time-varying demand. Management Sci. 42(10):1383-1394. (Pubitemid 126592436)
11. Kang W, Ramanan K (2010) Fluid limits of many-server queues with reneging. Ann. Appl. Probab. 20:2204-2260.
12. Kaspi H, Ramanan K (2011) Law of large numbers limits for many-server queues. Ann. Appl. Probab. 21:33-114.
13. t + GI many-server fluid queue. Queueing Systems 71:405-444.
14. t queueing model experiencing periods of overloading. Oper. Res. Lett. 40:307-312.
15. Liu Y, Whitt W (2012c) Many-server heavy-traffic limit for queues with time-varying parameters. Working paper, Columbia University, New York. http://www.columbia.edu/~ww2040/allpapers.html.
16. Mandelbaum A, Massey WA, Reiman MI (1998) Strong approximations for Markovian service networks. Queueing Systems 30:149-201. (Pubitemid 128370856)
17. Massey WA, Whitt W (1993) Networks of infinite-server queues with nonstationary Poisson input. Queueing Systems 13:183-250.
18. Massey WA, Whitt W (1994) An analysis of the modified offered load approximation for the nonstationary Erlang loss model. Ann. Appl. Probab. 4:1145-1160.
19. Massey WA, Whitt W (1997) Peak congestion in multi-server service systems with slowly varying arrival rates. Queueing Systems 25:157-172.
20. Whitt W (1981) Comparing counting processes and queues. Adv. Appl. Probab. 14:207-220.
21. Whitt W (2005) Engineering solution of a basic call-center model. Management Sci. 51(2):221-235. (Pubitemid 40360164)
22. Whitt W (2006) Fluid models for multiserver queues with abandonments. Oper. Res. 54(1):37-54.
23. Wolff RW (1977) An upper bound for multi-channel queues. J. Appl. Probab. 14:884-888.
24. Wolff RW (1987) Upper bounds on work in system for multichannel queues. J. Appl. Probab. 24:547-551.
25. Zeltyn S, Mandelbaum A (2005) Call centers with impatient customers: Many-server asymptotics of the M/M/n + G queue. Queueing Systems 51:361-402. (Pubitemid 41813337)