On the \(\text{GI/M/1}\) queue with vacations and multiple service phases (Q1992598)

Summary: This paper considers a \(G I / M / 1\) queue with vacations and multiple service phases. Whenever the system becomes empty, the server takes a vacation, causing the system to move to vacation phase \(0\). If the server returns from a vacation to find no customer waiting, another vacation begins. Otherwise, the system jumps from phase \(0\) to some service phase \(i\) with probability \(q_i, i = 1,2, \ldots, N \). Using the matrix geometric solution method and semi-Markov process, we obtain the distributions of the stationary system size at both arrival and arbitrary epochs. The distribution of the stationary waiting time of an arbitrary customer is also derived. In addition, we present some performance measures such as mean waiting time of an arbitrary customer, mean length of the type-\(i\) cycle, and mean number of customers in the system at the end of phase \(0\). Finally, some numerical examples are presented.