Computational analysis of M(n)/G/1/N queues with setup time

An efficient iterative algorithm is developed for computing the stationary queue length distribution in M/G/1/N queues with setup time and arbitrary state dependent arrival rates. The overall computation of the algorithm is O(N2) in complexity. Our numerical investigations demonstrate the strength of the algorithm.