Single-server queues with impatient customers

We consider a single-server queueing system in which a customer gives up whenever his waiting time is larger than a random threshold, his patience time. In the case of a GI/GI/1 queue with i.i.d. patience times, we establish the extensions of the classical GI/GI/1 formulae concerning the stability condition and the relation between actual and virtual waiting-time distribution functions. We also prove that these last two distribution functions coincide in the case of a Poisson input process and determine their common law.

[1]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[2]  D. Y. Barrer Queuing with Impatient Customers and Ordered Service , 1957 .

[3]  S. Mikhlin CHAPTER III – SINGULAR INTEGRAL EQUATIONS , 1957 .

[4]  G. F. Newell,et al.  Introduction to the Theory of Queues. , 1963 .

[5]  Michel Loève,et al.  Probability Theory I , 1977 .

[6]  D. J. Daley,et al.  Single-server queueing systems with uniformly limited queueing time , 1964, Journal of the Australian Mathematical Society.

[7]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[8]  Boris Gnedenko,et al.  Introduction to queueing theory , 1968 .

[9]  J. W. Cohen,et al.  Single server queues with restricted accessibility , 1969 .

[10]  J. R. Callahan A queue with waiting time dependent service times , 1973 .

[11]  L. Takács A single-server queue with limited virtual waiting time , 1974, Journal of Applied Probability.

[12]  Erhan Çinlar,et al.  Introduction to stochastic processes , 1974 .

[13]  Aleksandr Alekseevich Borovkov,et al.  Stochastic processes in queueing theory , 1976 .

[14]  Jacob Cohen,et al.  On regenerative processes in queueing theory , 1976 .

[15]  Bezalel Gavish,et al.  The Markovian Queue with Bounded Waiting time , 1977 .

[16]  R. Tweedie Criteria for classifying general Markov chains , 1976, Advances in Applied Probability.

[17]  R. Tweedie Hitting times of Markov chains, with application to state-dependent queues , 1977, Bulletin of the Australian Mathematical Society.

[18]  Guy Pujolle,et al.  Recurrence in single server queues with impatient customers , 1978 .

[19]  R. Tweedie,et al.  Techniques for establishing ergodic and recurrence properties of continuous‐valued markov chains , 1978 .

[20]  Per Hokstad Note---A Single Server Queue with Constant Service Time and Restricted Accessibility , 1979 .

[21]  R. Haugen,et al.  Queueing Systems with Stochastic Time out , 1980, IEEE Trans. Commun..

[22]  François Baccelli,et al.  ON QUEUES WITH IMPATIENT CUSTOMERS. , 1981 .