Note on a binomial schedule for an M\(^{X}\)/G/1 queueing system with an unreliable server (Q361585)

Summary: We consider a batch arrival queueing system with an unreliable server. If the queue is empty at a service completion, then the server becomes inactive and begins an idle period. However, if the queue is not empty, then the server will take at most \(K\) vacation before serving the next customer. A linear cost structure is developed for the system and the optimal value of \(K\) is obtained.