N-policy queueing system with finite source and warm spares

In this paper, an N-Policy queueing system with startup time, finite source and warm spares is considered. We derive closed form expressions for recursively calculating the stationary distribution and present an efficient algorithm to find the stationary probability distribution of the number of customers in the system as well as the performance measures of these models. The algorithm is extremely powerful and can solve dozens of standard and non-standard queueing problems as special cases. An example and some numerical results are also presented.