Asymptotic analysis of queueing systems with reneging: A survey of results for FIFO, single class models

Surveys in Operations Research and Management Science

Volumn 17, Issue 1, 2012, Pages 1-14

  Ward, Amy R ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 82955165145     PISSN: 18767354     EISSN: None     Source Type: Book Series    
DOI: 10.1016/j.sorms.2011.08.002     Document Type: Review

References (90)

1. Aksin Z., Armony M., Mehrotra V. The modern call center: a multi-disciplinary perspective on operations management research. Production and Operations Management 2007, 16(6):665-688.
2. Gans N., Koole G., Mandelbaum A. Telephone call centers: Tutorial, review, and research prospects. M&SOM 2003, 5(2):79-141.
3. B. Zhang, J.S.H. van Leeuwaarden, B. Zwart, Staffing call centers with impatient customers: Refinements to many-server asymptotics, Operations Research, 2010 (in press).
4. Bhattacharya P., Ephremides A. Optimal scheduling with strict deadlines. IEEE Transactions on Automatic Control 1989, 34(7):721-728.
5. Panwar S.S., Towsley D., Wolf J.K. Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service. Journal of the Association for Computing Machinery 1988, 35:832-844.
6. Green L.V., Soares J., Giglio J.F., Green R.A. Using queueing theory to increase the effectiveness of emergency department provider staffing. Academic Emergency Medicine 2006.
7. Su X., Zenios S.A. Patient choice in kidney allocation: the role of the queueing discipline. M&SOM 2004, 6(4):280-301.
8. Nahmias S. Perishable inventory theory: a review. Operations Research 1982, 30(4):680-708.
9. Kaspi H., Perry D. Inventory systems of perishable commodities. Advances in Applied Probability 1983, 15(3):674-685.
10. Kruk L., Lehoczky J., Ramanan K., Shreve S. Heavy traffic analysis for EDF queues with reneging. The Annals of Applied Probability 2011, 21(2):484-545.
11. B. Ata, M. Rubino, Dynamic control of a make-to-order parallel server system with cancellations, 2009.
12. S. Ghamami, A.R. Ward, Dynamic scheduling of a two-server parallel server system with complete resource pooling and reneging in heavy traffic: asymptotic optimality of a two-threshold policy, Working Paper, 2010.
13. Ghosh A.P., Weerasinghe A. Optimal buffer size and dynamic rate control for a queueing network with impatient customers in heavy traffic. Stochsatic Processes and their Applications 2010, 120:2103-2141.
14. Atar R. Scheduling control for queueing systems with many servers: asymptotic optimality in heavy traffic. The Annals of Applied Probability 2005, 15(4):2606-2650.
15. Atar R. A diffusion model of scheduling control in queueing systems with many servers. The Annals of Applied Probability 2005, 15(1B):820-852.
16. R. Atar, C. Giat, N. Shimkin, The cμ/θ rule for many-server queues with abandonment, Operations Research, 2009 (in press).
17. R. Atar, C. Giat, N. Shimkin, On the asymptotic optimality of the cμ/θ rule under ergodic cost, Working Paper, 2010.
18. Atar R., Mandelbaum A., Reiman M.I. Scheduling a multi class queue with many exponential servers: asymptotic optimality in heavy traffic. The Annals of Applied Probability 2004, 14(3):1084-1134.
19. Gurvich I., Whitt W. Service-level differentiation in many-server service systems via queue-ratio routing. Operations Research 2010, 58(2):316-328.
20. Harrison J.M., Zeevi A. Dynamic scheduling of a multiclass queue in the Halfin and Whitt heavy traffic regime. Operations Research 2004, 52:243-257.
21. Perry O., Whitt W. Responding to unexpected overloads in large-scale service systems. Management Science 2009, 55(8):1353-1367.
22. Tezcan T., Dai J. Dynamic control of N-systems with many servers: asymptotic optimality of a static priority policy in heavy traffic. Operations Research 2010, 58:94-110.
23. Ancker C.J., Gafarian A. Queueing with impatient customers who leave at random. Journal of Industrial Engineering 1962, 13:84-90.
24. Boots N.K., Tijms H. A multiserver queueing system with impatient customers. Management Science 1999, 45(3):444-448.
25. Whitt W. Improving service by informing customers about anticipated delays. Management Science 1999, 45(2):192-207.
26. Reiman M.I. The heavy traffic diffusion approximation for sojourn times in Jackson networks. Applied Probability-Computer Science, The Interface 1982, 409-422. Birkhauser, Boston, MA. R.L. Disney, T.J. Ott (Eds.).
27. Iglehart D.L., Whitt W. Multiple channel queues in heavy traffic i. Advances in Applied Probability 1970, 2(1):150-177.
28. Halfin S., Whitt W. Heavy-traffic limits for queues with many exponential servers. Operations Research 1981, 29(3):567-588.
29. Garnett O., Mandelbaum A., Reiman M. Designing a call center with impatient customers. M&SOM 2002, 4(3):208-227.
30. Ward A.R., Glynn P.W. A diffusion approximation for a Markovian queue with reneging. Queueing Systems 2003, 43:103-128.
31. Billingsley P. Convergence of Probability Measures 1999, John Wiley & Sons, Inc., New York. second ed.
32. Whitt W. Stochastic-Process Limits 2002, Springer, New York.
33. Mandelbaum A., Pats G. State-dependent queues: approximations and applications. Stochastic Networks 1995, 239-282. Springer, Berlin.
34. Coffman E.G., Puhalskii A.A., Reiman M.I., Wright P. Processor shared buffers with reneging. Performance Evaluation 1994, 19:25-46.
35. Gromoll C., Robert P., Zwart B. Fluid approximation of a processor sharing queue with reneging. Mathematics of Operations Research 2008, 33:375-402.
36. Chen H., Yao D.D. Fundamentals of Queueing Networks 2001, Springer, New York.
37. Glynn P.W. Diffusion approximations. Handbooks on OR&MS 1990, vol. 2:145-197. Elsevier Science Publishers B.V, North Holland.
38. R. Atar, A diffusion regime with non-degenerate slowdown, Working Paper, 2010.
39. P.J. Fleming, A. Stoylar, B. Simon, Heavy traffic limit for a mobile phone system loss model, in: Proc. 2nd Internat. Conf. Telecommunication Systems, Modeling, and Anal., Nashville, TN, 1994, pp 158-176.
40. Browne S., Whitt W. Piecewise-linear diffusion processes. Advances in queueing: Theory, Methods, and Open Problems 1995, 463-480. CRC Press, Boca Raton, FL. Dshalalow (Ed.).
41. Linetsky V. On the transition densities for reflected diffusions. Advances in Applied Probability 2005, 37:435-460.
42. Cox J.T., Rosler U. A duality relation for entrance and exit laws for Markov processes. Stochastic Processes and their Applications 1983, 16:141-156.
43. Ward A.R., Glynn P.W. Properties of the reflected Ornstein-Uhlenbeck process. Queueing Systems 2003, 44:109-123.
44. Harrison J.M. Brownian Motion and Stochastic Flow Systems 1985, Wiley, New York.
45. Abate J., Whitt W. Transient behavior of regulated Brownian motion, I: starting at the origin. Advances in Applied Probability 1987, 19:560-598.
46. Abate J., Whitt W. Transient behavior of regulated Brownian motion, II: non-zero initial conditions. Advances in Applied Probability 1987, 19:599-631.
47. J.S.H. van Leeuwaarden, C. Knessl, Spectral gap of the Erlang A model in the Halfin-Whitt regime, Working Paper, 2010.
48. J.S.H. van Leeuwaarden, C. Knessl, Transient behavior of the Halfin-Whitt diffusion, Working Paper, 2008.
49. A. Mandelbaum, Qed Q's. Notes from a lecture delivered at the workshop on heavy traffic analysis and process limits of stochastic networks, EURANDOM, September, 2003. http://ie.technion.ac.il/serveng/References/references.html.
50. Whitt W. How multiserver queues scale with growing congestion-dependent demand. Operations Research 2003, 51(4):531-542.
51. I. Gurvich, Design and control of the M/M/N queue with multi-type customers and many servers, Master's Thesis, Technion, 2004.
52. Baccelli F., Boyer P., Hebuterne G. Single-server queues with impatient customers. Advances in Applied Probability 1984, 16:887-905.
53. Bae J., Kim S., Lee E.Y. The virtual waiting time of the M/G/1 queue with impatient customers. Queueing Systems 2001, 38:485-494.
54. Barrer D.Y. Queueing with impatient customers and ordered service. Operations Research 1957, 5:650-656.
55. Boxma O., Perry D., Stadje W. The M/G/1+G queue revisited. Queueing Systems 2011, 67(3):207-220.
56. Boxma O.J., Perry D., Stadje W., Zacks S. The M/G/1 queue with quasi-restricted accessibility. Stochastic Models 2009, 25:151-196.
57. Brandt A., Brandt M. On the M(n)/M(n)/s queue with impatient calls. Performance Evaluation 1999, 35:1-18.
58. Brandt A., Brandt M. Asymptotic results and a Markovian approximation for the M(n)/M(n)/s+GI system. Queueing Systems 2002, 41:73-94.
59. Finch P.D. Deterministic customer impatience in the queueing system GI/M/1. Biometrika 1960, 47:45-52.
60. Gavish B., Schweitzer P.J. The Markovian queue with bounded waiting time. Management Science 1977, 23:1349-1357.
61. B.W. Gnedenko, I.N. Kovalenko, Introduction to Queueing Theory, Israel Program for Scientific Translations, Jerusalem, 1968.
62. Jurkevic O.M. On many-server systems with stochastic bounds for the waiting time. Izvestiya Akademii Nauk SSSR Techniceskaja kibernetika 1971, 4:39-46. in Russian.
63. Movaghar A. On queueing with customer impatience until the beginning of service. Queueing Systems 1998, 29:337-350.
64. Perry D., Asmussen S. Rejection rules in the M/G/1 queue. Queueing Systems 1995, 19:105-130.
65. Rao S.S. Queueing models with balking and reneging in M/G/1 systems. Metrika 1967/1968, 6:173-188.
66. Stanford R.E. Reneging phenomena in single channel queues. Mathematics of Operations Research 1979, 4:162-178.
67. Ward A.R., Glynn P.W. A diffusion approximation for a GI/GI/1 queue with balking or reneging. Queueing Systems 2005, 50(4):371-400.
68. Reed J.E The G/GI/N queue in the Halfin-Whitt regime. The Annals of Applied Probability 2009, 19(6):2211-2269.
69. A. Mandelbaum, P. Momcilovic, Queues with many servers and impatient customers, Working Paper, 2010.
70. Dai J., He S., Tezcan T. Many-server diffusion limits for G/Ph/n+GI queues. The Annals of Applied Probability 2010, 20:1854-1890.
71. Dai J., He S. Customer abandonment in many-server queues. Mathematics of Operations Research 2010, 35:347-362.
72. Iravani F., Balcioglu B. Approximations for the M/GI/N+GI type call center. Queueing Systems 2008, 58:137-153.
73. Whitt W. Engineering solution of a basic call center model. Management Science 2005, 51(2):221-235.
74. Talreja R., Whitt W. Heavy-traffic limits for waiting times in many-server queues with abandonment. The Annals of Applied Probability 2009, 19(6):2137-2175.
75. Mandelbaum A., Zeltyn S. Call centers with impatient customers: many-server asymptotics of the M/M/n+G queue. Queueing Systems 2005, 51(3/4):361-402.
76. Blanchet J., Glynn P. Complete corrected diffusion approximations for the maximum of a random walk. The Annals of Applied Probability 2006, 16:951-983.
77. Janssen A.J.E.M., van Leeuwaarden J.S.H., Zwart B. Corrected asymptotics for a multi-server queue in the Halfin-Whitt regime. Queueing Systems 2008, 58:261-301.
78. Reed J.E, Ward A.R. Approximating the GI/GI/1+GI queue with a nonlinear drift diffusion: hazard rate scaling in heavy traffic. Mathematics of Operations Research 2008, 33(3):606-644.
79. J.E Reed, T. Tezcan, Hazard rate scaling for the GI/M/N+GI queue, Working Paper, 2009.
80. C. Lee, A. Weerasinghe, Convergence of a queueing system in heavy traffic with general patience-time distributions, Working Paper, 2011.
81. Whitt W. Heavy-traffic limits for loss proportions in single-server queues. Queueing Systems 2004, 46(3-4):507-536.
82. O. Jennings, J.E Reed, An overloaded multiclass FIFO queue with abandonments, Operations Research (2010) (forthcoming).
83. Whitt W. Fluid models for multiserver queues with abandonments. Operations Research 2006, 54(1):37-54.
84. Bassamboo A., Randhawa R.S. On the accuracy of fluid models for capacity sizing in queueing systems with impatient customers. Operations Research 2010, 58(5):1398-1413.
85. Kang W., Ramanan K. Fluid limits of many-server queues with reneging. The Annals of Applied Probability 2010, 20(6):2204-2260.
86. Kaspi H., Ramanan K. Law of large numbers limits for many-server queues. The Annals of Applied Probability 2011, 21(1):33-114.
87. W. Kang, K. Ramanan, Asymptotic approximations for stationary distributions of many-server queues with abandonment, Working Paper, 2010.
88. Ethier S.N., Kurtz T.G. Markov Processes: Characterization and Convergence 1986, Wiley, New York.
89. Stone C. Limit theorems for random walks, birth and death processes, and diffusion processes. Illinois Journal of Mathematics 1963, 7:638-660.
90. A. Mandelbaum, 4callcenters v2.2.3. Download from http://iew3.technion.ac.il/serveng.