A diffusion regime with nondegenerate slowdown

Operations Research

Volumn 60, Issue 2, 2012, Pages 490-500

  Atar, Rami ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Conventional diffusion regime; Diffusion limits; ED and QED regimes; Heavy traffic; Many server queue; Nondegenerate slowdown regime

Indexed keywords

DIFFUSION LIMITS; DIFFUSION REGIMES; ED AND QED REGIMES; HEAVY TRAFFICS; MANY-SERVER QUEUE; NONDEGENERATE SLOWDOWN REGIME;

COMPUTER APPLICATIONS; OPERATIONS RESEARCH;

DIFFUSION;

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

References (22)

1. Anderson, R. F., S. Orey. 1976. Small random perturbation of dynamical systems with reflecting boundary. Nagoya Math. J. 60 189-216.
2. Armony, M. 2005. Dynamic routing in large-scale service systems with heterogeneous servers. Queueing Systems 51(3-4) 287-329. (Pubitemid 41813335)
3. Atar, R., M. I. Reiman. 2012. Asymptotically optimal dynamic pricing for network revenue management. Submitted.
4. Atar, R., A. Shwartz. 2008. Efficient routing in heavy traffic under partial sampling of service times. Math. Oper. Res. 33(4) 899-909.
5. Atar, R., A. Mandelbaum, M. I. Reiman. 2004. Scheduling a multiclass queue with many exponential servers: Asymptotic optimality in heavy-traffic. Ann. Appl. Probab. 14(3) 1084-1134. (Pubitemid 41449212)
6. Brown, L., N. Gans, A. Mandelbaum, A. Sakov, H. Shen, S. Zeltyn, L. Zhao. 2005a. Statistical analysis of a telephone call center: A queueing-science perspective. J. Amer. Statist. Assoc. 100(469) 36-50. (Pubitemid 40366817)
7. Brown, L., N. Gans, A. Mandelbaum, A. Sakov, H. Shen, S. Zeltyn, L. Zhao. 2005b. Statistical analysis of a telephone call center: A queueing-science perspective. Extended version of Brown et al. (2005a). http://ie.technion.ac.il/ serveng/References/references.html.
8. Garnett, O., A. Mandelbaum, M. Reiman. 2002. Designing a call center with impatient customers. Manufacturing Service Oper. Management 4(3) 208-227.
9. Gurvich, I. 2004. Design and control of the M/M/N queue with multi-class customers and many servers. M.Sc. thesis, Technion, Haifa, Israel.
10. Halfin, S., W. Whitt. 1981. Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29(3) 567-588. (Pubitemid 12437583)
11. Harrison, J. M. 1998. Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies. Ann. Appl. Probab. 8(3) 822-848. (Pubitemid 128337375)
12. Harrison, J. M. 2003. A broader view of Brownian networks. Ann. Appl. Probab. 13(3) 1119-1150. (Pubitemid 39051000)
13. Kushner, H. J. 2001. Heavy Traffic Analysis of Controlled Queueing and Communication Networks. Applications of Mathematics, Vol. 47. Springer-Verlag, New York.
14. Mandelbaum, A. 2003. QED Q's. Notes from lecture delivered at workshop on heavy traffic analysis and process limits of stochastic networks. EURANDOM, Eindhoven, The Netherlands. http://ie.technion.ac.il/serveng/References/ references.html.
15. Mandelbaum, A. 2009. Private communication.
16. Mandelbaum, A., G. Shaikhet. 2004. Private communication.
17. Ward, A. R., P. W. Glynn. 2003a. A diffusion approximation for a Markovian queue with reneging. Queueing Systems 43(1-2) 103-128.
18. Ward, A. R., P. W. Glynn. 2003b. Properties of the reflected Ornstein- Uhlenbeck process. Queueing Systems 44(2) 109-123.
19. Whitt, W. 1992. Understanding the efficiency of multi-server service systems. Management Sci. 38(5) 708-723.
20. Whitt, W. 2002. Stochastic-Process Limits. Springer Series in Operations Research. Springer-Verlag, New York.
21. Whitt, W. 2003. How multiserver queues scale with growing congestiondependent demand. Oper. Res. 51(4) 531-542.
22. Whitt, W. 2004. Efficiency-driven heavy-traffic approximations for many-server queues with abandonments. Management Sci. 50(10) 1449-1461.