Optimal repairable M<SUP align="right">X</SUP>/G/1 queue with Bernoulli feedback and setup

Abstract

We consider an MX/G/1 queue with Bernoulli feedback under N-policy. According to N-policy, the server starts the service only if N customers are accumulated in the system. The server undergoes breakdown during the busy state, which is then repaired by the repairman in k number of phases. Both the server and the repairman take start-up and set-up times, respectively. Using the supplementary variable technique and the generating function method, we establish the stationary distribution of the queue length and various other queueing characteristics. Using the maximum entropy approach. We determine the approximate results for the steady-state probability distributions of the queue length and the waiting time of an arbitrary customer in the queue.