Improving the Quality of M/M/m/K Queueing Systems Using System Cost Function Optimization

Document Type : Original Article

Authors

1 Department of Statistics, Payame Noor University,Tehran, Iran

2 Department of Statistics, Payame Noor University, Tehran, Iran

Abstract
In this article, a queuing system with finite capacity, referred to as M/M/m/K, is analyzed for m ≥ 2, where K represents the system's capacity and m indicates the number of servers. Initially, a function known as the system cost function is introduced. This function is based on the number of customers present in the queue and the number of servers available. The main objective is to identify the optimal number of servers, termed mOpt, that minimizes the system cost function. This optimal configuration, denoted as M/M/mOpt/K, is termed the optimal system. To illustrate the concept, a numerical example is provided, showcasing various values of K to determine the optimal systems. The analysis covers key performance metrics such as the average number of customers in the queue and the entire system, the average waiting time of the customers both in the queue and the system, and a metric referred to as the average degree of customer satisfaction within these queuing systems. Through this comprehensive approach, the study aims to provide valuable insights into optimizing queuing systems for better efficiency and customer satisfaction.

Keywords


1]  Balsamo, S., Di Persone, V., & Inverardi, P. (2003). A review on queuing network models with finite capacity queues for software architectures performance prediction. Performance Evaluation, 51, 269-288.
[2]  Takagi, H., Yoshino, H., Matoba, N., Azuma, M., & Shirakabe, M. (2005). System capacity calculation for packet-switched traffic in the next generation wireless systems, Part II: Batch arrival M/G/1 nonpreemptive priority queuing model for transmission over a radio channel. Performance Challenges for Efficient Next Generation Networks, 6A–6C, 21-30.
[3]  Bocharov, P. P., & Viskova, E. V. (2005). A single-server finite-capacity queuing system with Markov flow and discrete-time service. Automat. Remote Control, 66(2), 233-248.
[4]  Gupta, U. C., & Sikdar, K. (2006). Computing queue length distributions in MAP/G/1/N queue under single and multiple vacation. Applied Mathematics and Computation, 17(2), 1498-1525.
[5]  Jain, M. (2005). Finite capacity M/M/r queuing system with queue-dependent servers. Computational Mathematics Applications, 50, 187-199.
[6]  Thomas, N. (2006). Approximation in non-product form finite capacity queue systems. Future Generation Computer Systems, 22(7), 820-827.
[7]  Wang, K. H., & Ke, J. C. (2000). A recursive method to the optimal control of an M/G/1 queuing system with finite capacity and infinite capacity. Applied Mathematical Modelling, 24, 899-914.
[8]  Ziya, S., Ayhan, H., & Foley, R. D. (2006). Optimal prices for finite capacity queuing systems. Operations Research Letters, 34, 214-218.
[9]  Chen, S. P. (2007). Solving fuzzy queuing decision problems via a parametric mixed-integer nonlinear programming method. European Journal of Operational Research, 177, 445-457.
[10]  Pardo, M. J., & De la Fuente, D. (2008). Optimal selection of the service rate for a finite input source fuzzy queuing system. Fuzzy Sets and Systems, 159(3), 325-342.
[11]  Zhang, Q. (2012). Multi-agent based bank queuing model and optimization. In Advances in electronic engineering, communication and management (Lecture Notes in Electrical Engineering, Vol. 142, pp. 121-121). Springer.
[12]  Taha, H. A. (2003). Operations research: An introduction (7th ed.). Prentice-Hall.
[13]  Modarres, M., & Teymouri, A. (2015). Queueing theory (6th ed.). Center for Scientific Publications, University of Science and Technology, Tehran.
[14]  Dubois, D., & Prade, H. (1980). Fuzzy sets and systems: Theory and applications. Academic Press.
[15]  Zadeh, L. A. (1968). Probability measures of fuzzy events. Journal of Mathematical Analysis and Applications, 23, 421-427.