An M/G/1 clearing queueing system with setup time and multiple vacations for an unreliable server

This paper studies an M/G/1 clearing queueing system with setup time and multiple vacations, in which all present customers in the system are served simultaneously and breakdowns may occur in busy or setup period. We investigate the stationary distribution of system size and the Laplace-Stieltjes transform of sojourn time. In addition, various performance measures are discussed, such as the mean system size at arbitrary time and the mean length of a vacation circle. Moreover, a cost analysis is carried out for this queueing system. Numerical results are presented to study the sensitivity of the system parameters on the expected cost function and system performances.