Transient solution of a non-empty chemical queueing system

Abstract

In this paper, we illustrate that a power series technique can be used to derive explicit expressions for the transient state distribution of a queueing problem having “chemical” rules with an arbitrary number of customers present initially in the system. Based on generating function and Laplace techniques Conolly et al. (in Math Sci 22:83–91, 1997) have obtained the distributions for a non-empty chemical queue. Their solution enables us only to recover the idle probability of the system in explicit form. Here, we extend not only the model of Conolly et al. but also get a new and simple solution for this model. The derived formula for the transient state is free of Bessel function or any integral forms. The transient solution of the standard M/M/1/∞ queue with λ = μ is a special case of our result. Furthermore, the probability density function of the virtual waiting time in a chemical queue is studied. Finally, the theory is underpinned by numerical results.