A bulk service queue with accessible and non-accessible batches

This paper deals with a single-server Poisson queue with a new bulk service rule. This rule admits each batch served to have not less than a and not more than b units such that the arriving units can enter service, without affecting the service time, if the size of the batch served is less than some fixed integer d(a•d•b). The steady state distributions of queue length, waiting time and occupation time are derived. Sample numerical results and graphs are presented.