A numerical solution for the multi-server queue with hyper-exponential service times (Q789115)

In this paper we present a numerical method for the \(GI| H_ 2| s\). It is based on a general solution for \(GI| H_ m| s\) which has been obtained using explicit matrix factorizations methods. We give a complete description of the algorithm which yields exact results for the complete steady state distributions of the actual waiting, the virtual waiting and the number of customers in the system both at arrival epochs and in continuous time. Some numerical examples are included.