World Congress on Engineering (WCE 2011), London, Canada, 6 - 08 July 2011, pp.45-47
This study is mainly concerned with the finite capacity queuing system with recurrent input, n heterogeneous servers, and no waiting line. In the system customers choose only one server from the empty servers with equal probability. When all servers are busy, customers depart from the system without taking any service. These customers are called "lost customers". In this study, the transition probabilities (p(ij)) of the embedded Markov chain are calculated using the generalization of the Takacs' formula. The steady-state probabilities can be obtained from pi(j) = Sigma(infinity)(i=o) pi(i)p(y) with Sigma(infinity)(j=0) pi(j) = 1. Since there is no waiting line, the loss probability (P-L) is equal to the probability that all servers are busy.