Minimizing the Loss Probability in M/M/2/1 Queueing System with Ordered Entry
- 1 Department of Mathematic, Faculty of Science, EL-Minia University, EL-Minia City, Egypt
Abstract
This study analyzed the M/M/2/1 queueing model with queue of length one (waiting room of capacity just one), heterogeneous servers and ordered entry using the method of semi-Markov process. The customers who arrive in the system enter the free server; if the two servers are free, the customers enter the first server. If the two servers are busy, just one customer can wait at the waiting room. If the two servers are busy and the waiting room has a customer, the following customers will leave the system without receiving any service. Such a customer is called LOST COSTOMER. The probability of lost customers in the queueing system under examination was computed. Furthermore, by using inequality obtained from Jensen’s inequality, it was shown that the loss probability was minimum when inter-arrival times fit deterministic distribution [ 1 ] [ 2 ].
- Alves, F.S.Q., Yehia, H.C., Pedrosa, L.A.C., Cruz, F.R.B. and Kerbache, L. (2011) Upper Bounds on Performance Measures of Heterogeneous M/M/c Queues. Mathematical Problems in Engineering, 2011, Article ID: 702834.
- Isguder, H.O. (2012) Minimizing the Loss Probability in GI/M/3/0 Queueing System with Ordered Entry. Scientific Research and Essays, 7, 963-968. https://doi.org/10.5897/SRE11.1979
- Bhat, U.N. (1972) Elements of Applied Stochastic Process. John Wiley & Sons, Inc., USA.
- Shahbazov, A.A. (2005).Generalization of the Takacs’ Formula for GI/M/n/0 Queuing System with Heterogeneous Servers. Proceedings of the World Congress on Engineering, London, 6-8 July 2011, 978-988.
- Kumar, B.K., Madheswari, S.P. and Venkatakrishnan, K.S. (2007) Transient Solution of an M/M/2 Queue with Heterogeneous Servers Subject to Catastrophes. Information and Management Sciences, 18, 63-80.
- Green, L. (1985) A Queueing System with General-Use and Limited-Use Servers. Operations Research, 33, 168-182. https://doi.org/10.1287/opre.33.1.168
- Singh, V.S. (1970) Two-Server Markovian Queues with Balking: Heterogeneous vs. Homogeneous Servers. Operations Research, 18, 145-159. https://doi.org/10.1287/opre.18.1.145
- Stewart, W.J. (1994) Introduction to the Numerical Solution of Markov Chains. Princeton University Press, New Jersey.
- GROSS, D., and Harris, C.M. (1974) Fundamentals of Queueing Theory. John Wiley & Sons, Inc., New York, U.S.A
- Mokaddis, G.S., Metwally, S.A. and Kamel, E.A. (2000) A Queueing System With General-Use, Subgeneral-Use and Limited-Use Servers. The 35th Annual Conference on Statistics Computer Sciences and Operations Research, ISSR, Cairo University, Egypt, Vol. 35, part (1), 115-133.
- Boucherie, R.J. and van Dijk, N.M. (2010) Queueing Networks: A Fundamental Approach, Vol. 154. Springer, Berlin.
- Cramér, H. (2016) Mathematical Methods of Statistics (PMS-9), Vol. 9. Princeton University Press, Princeton.
- Erlang, A.K. (1917) Solution of Some Problems in the Theory of Probabilities of Significance in Automatic Telephone Exchanges. Post Office Electrical Engineer’s Journal, 10, 189-197.
- Gontijo, G.M., Atuncar, G.S., Cruz, F.R.B. and Kerbache, L. (2011) Performance Evaluation and Dimensioning of GIX/M/c/N Systems through Kernel Estimation, Mathematical Problems in Engineering, 2011, Article ID: 348262.