Analysis of the GI/M/3/K queueing system by Semi-Markov process


Creative Commons License

İŞGÜDER H. O.

PAMUKKALE UNIVERSITY JOURNAL OF ENGINEERING SCIENCES-PAMUKKALE UNIVERSITESI MUHENDISLIK BILIMLERI DERGISI, vol.26, no.1, pp.195-202, 2020 (ESCI) identifier

Abstract

In this study, a queuing system of K-capacity with recurrent entry and three heterogeneous servers has been investigated. In the system discussed, inter-arrival times are independent of one another and have an arbitrary distribution. The service time of each server has an Exponential distribution with parameter mu(k). The customer who enters the system starts to receive service on the server with the lowest index number from the servers that are empty. If all servers are busy on arrival, the incoming customer joins the queue. When the system is at full capacity, the incoming customer leaves the system without receiving any service. The system under consideration was modeled using a semi-Markov process and the embedded Markov chain provided by the semi-Markov process was obtained. Steady-state probabilities and the probability of customer loss were calculated. Additionally, by performing optimization with respect to service discipline and arrival process, the loss probability is minimized. The obtained theoretical results are shown numerically for cases where the inter-arrival times followed Exponential, Erlang, and deterministic distributions.