ABSTRACT
The paper assays Markovian multiple servers, finite capacity queue in which customers can become impatient. The servers can take a synchronous vacation, which may lead to customer impatience due to the absence of servers upon arrival. At any time when the system is void, all of the servers go on vacation. When the system is void, that is, there are no customers in the system, the servers proceed on for one more vacation; otherwise, they return to serve the queue. The governing equations are obtained for the steady-state probabilities. The probability Generating Function method is used for arriving at the balance equations. In terms of two indexes, we get the expression for system length.
