The single server queue with inhomogeneous arrival rate and discrete service time distribution (Q1062688)

A practical method of calculating the distribution of the number of customers in the single server queueing system with inhomogeneous arrival rate and discrete service time distribution is proposed. The system is formulated as an inhomogeneous Markov chain in discrete time, leading to recurrence relations for the state probabilities. The recurrence relations are then solved numerically. Various measures of performance, such as mean and variance of the number of customers in the system and virtual waiting time can be obtained from these results. Examples are presented to demonstrate the scope of the method, including time-dependent behaviour of homogeneous queues; cyclic behaviour of queues with cyclic arrival rates; and a previously published study of an airport runway in which the author had to resort to crude interpolation to obtain results. The method can be further extended to provide a reasonably accurate approximation for some systems with continuous distributions of service times.