带有抢占优先权和重试的排队系统的优化分析
Optimization Analysis of Queueing Systems with Preemptive Priority and Retrial
摘要: 本文研究了带有抢占优先权和重试的M/M/1排队系统。首先,采用概率生成函数的方法,得到了系统的稳态概率和主要性能指标。然后考虑了双目标优化的问题,旨在同时最小化系统成本和顾客逗留时间,借助NSGA-II算法来寻找Pareto最优解集。最后建立了以最优成本为因变量,非优先权顾客的到达率、最优逗留时间以及最优逗留时间的负指数为自变量建立了回归模型,进行了回归分析及模型的显著性检验。本文的分析能够使系统在提高服务质量的同时最小化成本,研究结论对系统管理者来说具有一定的参考价值。
Abstract: In this paper, the M/M/1 queueing system with preemption priority and retrial is studied. First, the steady state probability and main performance measures of the system are obtained by using probability generating function method. Then, the problem of Bi-objective optimization is consid-ered to minimize both system cost and customer’ sojourn time, and NSGA-II algorithm is used to find the optimal solution set of Pareto. Finally, a regression model is established with the optimal cost as the dependent variable, the arrival rate of non-priority customers, the optimal sojourn time and the negative index of the optimal sojourn time as independent variables, the regression analy-sis and the significance test of the model are carried out. The analysis of this paper can improve the service quality of the system while minimizing the cost, and the research conclusion has a certain reference value for system managers.
文章引用:薛雅丹. 带有抢占优先权和重试的排队系统的优化分析[J]. 统计学与应用, 2024, 13(1): 91-99. https://doi.org/10.12677/SA.2024.131010

参考文献

[1] White, H. and Christie, L.S. (1958) Queuing with Preemptive Priorities or with Breakdown. Operations Research, 6, 79-95. [Google Scholar] [CrossRef
[2] Avi-Itzhak, B. and Naor, P. (1963) Some Queuing Problems with the Service Station Subject to Breakdown. Operations Research, 11, 303-320. [Google Scholar] [CrossRef
[3] Morse, P.M. (1958) Queues, Inventories and Maintenance. Wiley, New York.
[4] Wang, L.C., Wang, C.W. and Feng, K.T. (2011) A Queueing-Theoretical Framework for QoS-Enhanced Spectrum Management in Cognitive Radio Networks. IEEE Wireless Communications, 18, 18-26. [Google Scholar] [CrossRef
[5] Li, Q., Guo, P. and Wang, Y. (2020) Equilibrium Analysis of Unob-servable M/M/n Priority Queues with Balking and Homogeneous Customers. Operations Research Letters, 48, 674-681. [Google Scholar] [CrossRef
[6] Niyato, D., Hossain, E. and Fallahi, A. (2007) Sleep and Wakeup Strategies in Solar-powered Wireless Sensor/Mesh Networks: Performance Analysis and Optimization. IEEE Transactions on Mobile Computing, 6, 221-236. [Google Scholar] [CrossRef
[7] Do, C.T., Tran, N.H., Van, N.M., et al. (2012) Social Optimization Strategy in Unobserved Queueing Systems in Cognitive Radio Networks. IEEE Communications Letters, 16, 1944-1947. [Google Scholar] [CrossRef
[8] Wang, J. and Zhang, F. (2013) Strategic Joining in M/M/1 Retrial Queues. European Journal of Operational Research, 230, 76-87. [Google Scholar] [CrossRef
[9] 张峰. 排队服务系统中策略性顾客的经济博弈策略分析[D]: [博士学位论文]. 北京: 北京交通大学, 2014.
[10] Jailaxmi, V., Arumuganathan, R. and Senthil, K.M. (2017) Performance Analysis of an M/G/1 Retrial Queue with General Retrial Time, Modified M-Vacations and Collision. Operational Research, 17, 649-667. [Google Scholar] [CrossRef
[11] Lakaour, L., Aïssani, D., Adel-Aissanou, K., et al. (2019) M/M/1 Retrial Queue with Collisions and Transmission Errors. Methodology and Computing in Applied Probability, 21, 1395-1406. [Google Scholar] [CrossRef
[12] Goel, S. and Kulshrestha, R. (2022) Queueing Based Spectrum Man-agement in Cognitive Radio Networks with Retrial and Heterogeneous Service Classes. Journal of Ambient Intelligence and Humanized Computing, 13, 2429-2437. [Google Scholar] [CrossRef
[13] 张钰, 王金亭. 服务台不可靠的重试排队系统均衡分析[J]. 运筹学学报, 2022, 26(2): 1-15.
[14] Tavakkoli-Moghaddam, R., Vazifeh-Noshafagh, S., Taleizadeh, A.A., et al. (2017) Pricing and Location Decisions in Multi-Objective Facility Location Problem with M/M/m/k Queuing Systems. Engineering Optimization, 49, 136-160. [Google Scholar] [CrossRef
[15] Khodemani-Yazdi, M., Tavakkoli-Moghaddam, R., Bashiri, M., et al. (2019) Solving a New Bi-Objective Hierarchical Hub Location Problem with an M/M/c Queuing Framework. Engineering Applications of Artificial Intelligence, 78, 53-70. [Google Scholar] [CrossRef