A Diffusion Approximation for a GI/GI/1 Queue with Balking or Reneging

Consider a single-server queue with a renewal arrival process and generally distributed processing times in which each customer independently reneges if service has not begun within a generally distributed amount of time. We establish that both the workload and queue-length processes in this system can be approximated by a regulated Ornstein-Uhlenbeck (ROU) process when the arrival rate is close to the processing rate and reneging times are large. We further show that a ROU process also approximates the queue-length process, under the same parameter assumptions, in a balking model. Our balking model assumes the queue-length is observable to arriving customers, and that each customer balks if his or her conditional expected waiting time is too large.

[1]  G. Pile Étude des délais d'attente des aéronefs à l'atterrissage , 1955 .

[2]  D. Iglehart,et al.  Multiple channel queues in heavy traffic. I , 1970, Advances in Applied Probability.

[3]  Robert E. Stanford,et al.  Reneging Phenomena in Single Channel Queues , 1979, Math. Oper. Res..

[4]  P. Hall,et al.  Martingale Limit Theory and Its Application , 1980 .

[5]  F. Baccelli,et al.  Single-server queues with impatient customers , 1984, Advances in Applied Probability.

[6]  Martin I. Reiman,et al.  Some diffusion approximations with state space collapse , 1984 .

[7]  J. Harrison,et al.  Brownian motion and stochastic flow systems , 1986 .

[8]  Edward G. Coffman,et al.  Processor-Shared Buffers with Reneging , 1994, Perform. Evaluation.

[9]  W. Whitt,et al.  PIECEWISE-LINEAR DIFFUSION PROCESSES , 1995 .

[10]  W. Whitt,et al.  Improving Service by Informing Customers About Anticipated Delays , 1999 .

[11]  R. Lillo,et al.  STABILITY IN QUEUES WITH IMPATIENT CUSTOMERS , 2001 .

[12]  Erica L. Plambeck,et al.  A Multiclass Queue in Heavy Traffic with Throughput Time Constraints: Asymptotically Optimal Dynamic Controls , 2001, Queueing Syst. Theory Appl..

[13]  S. Shreve,et al.  Real-time queues in heavy traffic with earliest-deadline-first queue discipline , 2001 .

[14]  David D. Yao,et al.  Fundamentals of Queueing Networks , 2001 .

[15]  Avishai Mandelbaum,et al.  Designing a Call Center with Impatient Customers , 2002, Manuf. Serv. Oper. Manag..

[16]  Peter W. Glynn,et al.  A Diffusion Approximation for a Markovian Queue with Reneging , 2003, Queueing Syst. Theory Appl..

[17]  Peter W. Glynn,et al.  Properties of the Reflected Ornstein–Uhlenbeck Process , 2003, Queueing Syst. Theory Appl..

[18]  D. Yao,et al.  Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization , 2001, IEEE Transactions on Automatic Control.

[19]  Avishai Mandelbaum,et al.  The impact of customers’ patience on delay and abandonment: some empirically-driven experiments with the M/M/n + G queue , 2004, OR Spectr..

[20]  David Gamarnik,et al.  Validity of Heavy Traffic Steady-State Approximations in Open Queueing Networks , 2004 .

[21]  Amy R. Ward,et al.  A diffusion approximation for a generalized Jackson network with reneging , 2004 .

[22]  Avishai Mandelbaum,et al.  Statistical Analysis of a Telephone Call Center , 2005 .