Discussion on the transient solution of single server Markovian multiple variant vacation queues with disasters.

This paper studies a single server Markovian queue with the possibility of catastrophes at the service station. In this model, the server takes a maximum number of J vacations till it finds at least one customer in the queue at a vacation completion instant. The time dependent probabilities of the system size are obtained. Four special cases are derived from the model presented in this study. Finally, some numerical computations are presented. [ABSTRACT FROM AUTHOR]