Finite population loss and delay queueing system with no passing

A loss and delay queueing system with no passing has been investigated in this paper. Due to restriction of no passing the customers are allowed to depart from the system in the chronological order of their arrival. The customers are classified into two classes depending upon whether they can wait or are lost when all servers are busy. The customers arriving in Poisson fashion from infinite/finite population at service facility having multi-servers, are served exponentially. The expressions for the expected waiting time are derived explicitly by using queue size distribution of the number of customers present in the system. The numerical results for the expected waiting time, and the difference between expected waiting times of customers having exponential service time and zero service time have been provided in tables for finite capacity and finite population models. The relevant graphs have also been drawn to visualise the effects of traffic intensity.