A matrix approach for the transient solution of an M/M/1/N queue with discouraged arrivals and reneging

摘要

This paper illustrates a computable matrix technique that can be used to derive explicit expressions for the transient state probabilities of a finite waiting space single-server queue, namely (M/M/l/N), having discouraged arrivals and reneging. The discipline is the classical first-come, first-served (FCFS). We obtain the transient solution of the system, with results in terms of the eigenvalues of a symmetric tridiagonal matrix. Finally, numerical calculations are given to illustrate the effectiveness of this technique and system behaviour.