Approximating the GI/GI/1+GI queue with a nonlinear drift diffusion: Hazard rate scaling in heavy traffic

Mathematics of Operations Research

Volumn 33, Issue 3, 2008, Pages 606-644

  Reed, J E ^a   Ward, Amy R ^b  

^a NEW YORK UNIVERSITY   (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

Abandonment; Customer impatience; Deadlines; Diffusion approximations; Generalized regulator mappings; Queueing theory; Reneging

Indexed keywords

ABANDONMENT; CUSTOMER IMPATIENCE; DEADLINES; DIFFUSION APPROXIMATIONS; GENERALIZED REGULATOR MAPPINGS; RENEGING;

CUSTOMER SATISFACTION; DIFFUSION; GAME THEORY; OPERATIONS RESEARCH; SALES;

QUEUEING THEORY;

EID: 61349192650     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1070.0303     Document Type: Article

References (39)

1. Ata, B., J. M. Harrison, L. A. Shepp. 2005. Drift rate control of a Brownian processing system. Ann. Appl. Probab. 15(2) 1145-1160.
2. Baccelli, F., P. Boyer, G. Hebuterne. 1984. Single-server queues with impatient customers. Adv. Appl. Probab. 16 887-905.
3. Billingsley, P. 1999. Convergence of Probability Measures, 2nd ed. John Wiley and Sons, Inc., New York.
4. Brown, L., N. Gans, A. Mandelbaum, A. Sakov, H. Shen, S. Zeltyn, L. Zhao. 2005. Statistical analysis of a telephone call center: A queueing-science perspective. J. Amer. Statist. Association 100 36-50.
5. Chen, H., D. D. Yao. 2001. Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization. Springer-Verlag, New York.
6. Dai, J. G., W Dai. 1999. A heavy traffic limit theorem for a class of open queueing networks with finite buffers. Queueing Systems 32 5-40.
7. Doytchinov, B., J. Lehoczky, S. Shreve. 2001. Real-time queues in heavy traffic with earliest-deadline-first queue discipline. Ann. Appl. Probab. 11 332-378.
8. Echeverria, P. 1982. A criterion for invariant measures of Markov processes. Z. Wahrsch. Verw. Gebiete 61 1-16.
9. Garnett, O., A. Mandelbaum, M. I. Reiman. 2002. Designing a call center with, impatient customers. Manufacturing and Service Oper. Management 4 208-227.
10. Hall, P., C. C. Heyde. 1980. Martingale Limit Theory and Its Applications. Academic Press, New York.
11. Harrison, J. M. 1985. Brownian Motion and Stochastic Flow Systems. John Wiley and Sons, New York.
12. Iglehart, D. L., W. Whitt. 1970. Multiple channel queues in heavy traffic, Parts I and II. Adv. Appl. Probab. 2 150-177, 355-364.
13. Karatzas, I., S. E. Shreve. 1991. Brownian Motion and Stochastic Calculus, 2nd ed. Springer-Verlag, New York.
14. Kingman, J. F. C. 1961. The single server queue in heavy traffic. Proc. Cambridge Philos. Soc. 57 902-904.
15. Kingman, J. F. C. 1962. On queues in heavy traffic. J. Roy. Statist. Soc. Ser. B 24 383-392.
16. Kruk, L., J. Lehoczky, S. Shreve. 2006. Accuracy of state space collapse for earliest-deadline-first queues. Ann. Appl. Probab. 16(2) 516-581.
17. Kruk, L., J. Lehoczky, K. Ramanan, S. Shreve. 2007. An explicit formula for doubly reflected processes in [0, a]. Ann. Probab. 35(5) 1740-1768.
18. Kruk, L., J. Lehoczky, S. Shreve, S. Yeung. 2003. Multiple-input heavy-traffic real-time queues. Ann. Appl. Probab. 13(1) 54-99.
19. Kruk, L., J. Lehoczky, S. Shreve, S. Yeung. 2004. Earliest-deadline-first service in heavy traffic acyclic networks. Ann. Appl. Probab. 14(3) 1306-1352.
20. Lehoczky, J. 1997. Real-time queueing theory. Proc. IEEE Real-Time Systems Sympos., IEEE, San Francisco, 186-195.
21. Lillo, R., M. Martin. 2001. Stability in queues with, impatient customers. Stochastic Models 17 375-389.
22. Mandelbaum, A., N. Shimkin. 2000. A model for rational abandonment from invisible queues. Queueing Systems 36 141-173.
23. Palm, C. 1937. Etude des delais d'attente. Ericsson Technics 5 37-56.
24. Reed, J. E., A. R. Ward. 2004. A diffusion approximation for a generalized Jackson network with reneging. Proc. 42nd Allerton Conf. Comm., Control, and Comput., Monticello, IL.
25. Reiman, M. I. 1982. The heavy traffic diffusion approximation for sojourn times in Jackson networks. R. L. Disney, T. J. Ott, eds. Applied Probability-Computer Science, The Interface. Birkhauser, Boston.
26. Reiman, M. I. 1984. Some diffusion approximations with state space collapse. F. Baccelli, G. Fayolle, eds. Modelling and Performance Evaluation Methodology. Springer-Verlag, New York, 209-240.
27. Resnick, S. I. 1999. A Probability' Path. Birkhauser, Boston.
28. Skorokhod, A. V. 1961. Stochastic equations for diffusions in a bounded region 1, Parts 1 and 2. Theoret. Probab. Its Appl. 6 264-274.
29. Stanford, R. E. 1979. Reneging phenomena in single channel queues. Math. Oper. Res. 4 162-178.
30. Ward, A. R., N. Bambos. 2003. On stability of queueing networks with job deadlines. J. Appl. Probab. 40 293-304.
31. Ward, A. R., P. W. Glynn. 2003a. A diffusion approximation for a Markovian queue with reneging. Queueing Systems 43 103-128.
32. Ward, A. R., P. W. Glynn. 2003b. Properties of the reflected Ornstein-Uhlenbeck process. Queueing Systems 44 109-123.
33. Ward, A. R., P. W. Glynn. 2005. A diffusion approximation for a GI/GI/1 queue with balking or reneging. Queueing Systems 50 371-400.
34. Ward, A., S. Kumar. 2008. Asymptotically optimal admission control of a queue with impatient customers. Math. Oper: Res. 33(1) 167-202.
35. Whitt, W. 2002. Stochastic-Process Limits. Springer-Verlag, New York.
36. Whitt, W. 2004. Heavy-traffic limits for loss proportions in single-server queues. Queueing Systems 46 507-536.
37. Whitt, W. 2005. Engineering solution of a basic call center model. Management Sci. 51(2) 221-235.
38. Zeltyn, S., A. Mandelbaum. 2005. Call centers with impatient customers: Many-server asymptotics of the M/M/n+G queue. Queueing Systems 51(3/4) 361-402.
39. Zohar, E., A. Mandelbaum, N. Shimkin. 2002. Adaptive behavior of impatient customers in tele-queues: Theory and empirical support. Management Sci. 48(4) 566-583.