The infinite server queue and heuristic approximations to the multi-server queue with and without retrials

M t /G/∞ Queue, M/M/m/m+d Queue, Retrial Queue, Stationary Distribution, Time-dependent Distribution, Asymptotic Approximation, Decomposition Formula, 60K25,

An infinite-server queue influenced by a semi-Markovian environment

We consider an infinite-server queue, where the arrival and service rates are both governed by a semi-Markov process that is independent of all other aspects of the queue. In particular, we derive a system of equations that are satisfied by various "parts" of the generating function of the steady-state queue-length, while assuming that all arrivals bring an amount of work to the system that is either Erlang or hyperexponentially distributed. These equations are then used to show how to derive all moments of the steady-state queue-length. We then conclude by showing how these results can be slightly extended, and used, along with a transient version of Little’s law, to generate rigorous approximations of the steady-state queue-length in the case that the amount of work brought by a given arrival is of an arbitrary distribution

Analysis of a multiserver queue with setup times

This paper deals with the analysis of an M/M/c queueing system with setup times. This queueing model captures the major characteristics of phenomena occurring in production when the system consists in a set of machines monitored by a single operator.We carry out an extensive analysis of the system including limiting distribution of the system state, waiting time analysis, busy period and maximum queue length