•  
  •  
 

Abstract

In this paper we study a batch arrival queuing system. The server may break down while delivering service. However, repair is not provided immediately, rather it is delayed for a random amount of time. At the end of service, the server may process the next customer if any are available, or may take a vacation to execute some other job. Finally, the server implements the T-policy. We describe for this system an optimal management policy. Numerical examples are provided.


Share

COinS