On infinite server queues with batch arrivals
- 1 June 1966
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 3 (1) , 274-279
- https://doi.org/10.2307/3212053
Abstract
The queueing system studied in this paper is the one in which (i)there are an infinite number of servers, (ii)initially (att= 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 functionB(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 byar(r≧ 1), (vi)the batch sizes, the service times and the arrivals are independent.Keywords
This publication has 2 references indexed in Scilit:
- Letter to the Editor—The Output of an M/G/∞ Queuing System is PoissonOperations Research, 1963
- Congestion Systems with Incomplete ServiceJournal of the Royal Statistical Society Series B: Statistical Methodology, 1962