On infinite server queues with batch arrivals
- 1 June 1966
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 3 (01) , 274-279
- https://doi.org/10.1017/s0021900200114111
Abstract
The queueing system studied in this paper is the one in which (i) there are an infinite number of servers, (ii) initially (at t = 0) all the servers are idle, (iii) one server serves only one customer at a time and the service times are independent and identically distributed with distribution function B(t) (t > 0) and mean β(< ∞), (iv) the arrivals are in batches such that a batch arrives during (t, t + δt) with probability λ(t)δt + o(δt) (λ(t) > 0) and no arrival takes place during (t, t + δt) with the probability 1 –λ(t)δt + o(δt), (v) the batch sizes are independent and identically distributed with mean α(< ∞), and the probability that a batch size equals r is given by a r(r ≧ 1), (vi) the batch sizes, the service times and the arrivals are independent.Keywords
This publication has 1 reference indexed in Scilit:
- Letter to the Editor—The Output of an M/G/∞ Queuing System is PoissonOperations Research, 1963