Steady-state analysis of an ordered hunting scheduled multiserver queueing system with Markovian arrival process, infinite buffer, heterogeneous servers, and phase-type distribution of service

Ciro D'Apice; Alexander N. Dudin; Sergey A. Dudin; Rosanna Manzo; Ciro D'Apice; Alexander N. Dudin; Sergey A. Dudin; Rosanna Manzo

doi:10.3934/math.20261205

AIMS Mathematics

2026, Volume 11, Issue 9: 30403-30436. doi: 10.3934/math.20261205

Previous Article Next Article

Research article

Steady-state analysis of an ordered hunting scheduled multiserver queueing system with Markovian arrival process, infinite buffer, heterogeneous servers, and phase-type distribution of service

1.
Dipartimento di Scienze Aziendali–Management & Information Systems, University of Salerno, Via Giovanni Paolo Ⅱ, 132, Fisciano (SA), 84084, Italy
2.
Department of Applied Mathematics and Computer Science, Belarusian State University, Minsk, Belarus
3.
Dipartimento di Scienze Politiche e della Comunicazione, University of Salerno, Via Giovanni Paolo Ⅱ, 132, Fisciano (SA), 84084, Italy

Received: 05 July 2026 Revised: 06 September 2026 Accepted: 09 September 2026 Published: 18 September 2026
MSC : 60J28, 60K25, 90B22

This paper analyzes a infinite-capacity queueing system operating with multiple distinct servers. Phase-type distributions with different irreducible representations characterize the service times. The servers are indexed in a fixed order. The entry of customers is modeled according to a Markovian arrival process. Upon arrival, a customer is placed in the infinite-capacity buffer if all servers are busy. Conversely, if multiple servers are idle, the arriving customer occupies the free server with the lowest index. Jockeying between servers during service is prohibited. This system is a natural generalization of the classical system with Markovian arrival process, phase-type service distribution and N servers (MAP/PH/N) to the case where the servers can be distinct. Such a system frequently arises as a model for various real-world systems with heterogeneous equipment. A multidimensional Markov chain with an infinitesimal generator having a special block structure characterizes the state dynamics of the system. We present an explicit expression for the generator and derive the tractable ergodicity condition. The system states exhibit a matrix-geometric stationary distribution. Additionally, analytical expressions to evaluate the core system performance metrics are established. Closed-form formulations for the Laplace–Stieltjes transforms and the initial moments of the distribution regarding both sojourn and waiting times of a generic customer are derived. Finally, numerical examples are presented. These examples illustrate the dependence of the system's key performance measures on the arrival rate and the service rate of the slowest server. They also confirm the importance of accounting for correlation in the arrival process and volatility of service times and demonstrate how the results can be used for optimization purposes.
- Markovian arrival process,
- heterogeneous servers,
- phase-type distribution,
- ergodicity,
- performance measures
Citation: Ciro D'Apice, Alexander N. Dudin, Sergey A. Dudin, Rosanna Manzo. Steady-state analysis of an ordered hunting scheduled multiserver queueing system with Markovian arrival process, infinite buffer, heterogeneous servers, and phase-type distribution of service[J]. AIMS Mathematics, 2026, 11(9): 30403-30436. doi: 10.3934/math.20261205

Related Papers:

Abstract

This paper analyzes a infinite-capacity queueing system operating with multiple distinct servers. Phase-type distributions with different irreducible representations characterize the service times. The servers are indexed in a fixed order. The entry of customers is modeled according to a Markovian arrival process. Upon arrival, a customer is placed in the infinite-capacity buffer if all servers are busy. Conversely, if multiple servers are idle, the arriving customer occupies the free server with the lowest index. Jockeying between servers during service is prohibited. This system is a natural generalization of the classical system with Markovian arrival process, phase-type service distribution and N servers (MAP/PH/N) to the case where the servers can be distinct. Such a system frequently arises as a model for various real-world systems with heterogeneous equipment. A multidimensional Markov chain with an infinitesimal generator having a special block structure characterizes the state dynamics of the system. We present an explicit expression for the generator and derive the tractable ergodicity condition. The system states exhibit a matrix-geometric stationary distribution. Additionally, analytical expressions to evaluate the core system performance metrics are established. Closed-form formulations for the Laplace–Stieltjes transforms and the initial moments of the distribution regarding both sojourn and waiting times of a generic customer are derived. Finally, numerical examples are presented. These examples illustrate the dependence of the system's key performance measures on the arrival rate and the service rate of the slowest server. They also confirm the importance of accounting for correlation in the arrival process and volatility of service times and demonstrate how the results can be used for optimization purposes.

References

[1]	M. F. Neuts, Matrix-geometric solutions in stochastic models, North Chelmsford: Courier Corporation, 1994.
[2]	S. Asmussen, Applied probability and queues, 2Eds., New York: Springer, 2003. https://doi.org/10.1007/b97236
[3]	P. Buchholz, J. Kriege, I. Felko, Input modeling with phase-type distributions and Markov models: theory and applications, Cham: Springer, 2014. https://doi.org/10.1007/978-3-319-06674-5
[4]	C. A. O'Cinneide, Characterization of phase-type distributions, Stoch. Models, 6, (1990), 1–57. https://doi.org/10.1080/15326349908807134 doi: 10.1080/15326349908807134
[5]	C. A. O'Cinneide, Phase-type distributions: open problems and a few properties, Stoch. Models, 15 (1999), 731–757. https://doi.org/10.1080/15326349908807560 doi: 10.1080/15326349908807560
[6]	A. Horvath, M. Telek, Phase type distributions: theory and application, Hoboken: John Wiley & Sons, 2024. https://doi.org/10.1002/9781119419808
[7]	D. M. Lucantoni, New results on the single server queue with a batch Markovian arrival process, Stoch. Models, 7 (1991), 1–46. https://doi.org/10.1080/15326349108807174 doi: 10.1080/15326349108807174
[8]	S. R. Chakravarthy, The batch Markovian arrival process: A review and future work, In: Advance in probability and stochastic process, NewJersey: Notable Publications Inc., 2000, 21–49.
[9]	S. R. Chakravarthy, Introduction to Matrix-matrix-analytic methods in queues 1: Analytical and simulation approach–Basics, New York: London and John Wiley and Sons, 2022. https://doi.org/10.1002/9781394165421
[10]	A. N. Dudin, V. I. Klimenok, V. M. Vishnevsky, The theory of queuing systems with correlated flows, Cham: Springer, 2020. https://doi.org/10.1007/978-3-030-32072-0
[11]	M. G. Bernal, R. E. Lillo, J. Ramirez-Cobo, Call center data modeling: A queueing science approach based on Markovian arrival processe, Qual. Technol. Quant. M., 22 (2025), 631–658. https://doi.org/10.1080/16843703.2024.2371715 doi: 10.1080/16843703.2024.2371715
[12]	A. N. Dudin, S. A. Dudin, R. Manzo, L. Rarità, Analysis of multi-server priority queueing system with hysteresis strategy of servers reservation and retrials, Mathematics, 10 (2022), 3747. https://doi.org/10.3390/math10203747 doi: 10.3390/math10203747
[13]	C. D'Apice, A. N. Dudin, S. A. Dudin, R. Manzo, Priority queueing system with many types of requests and restricted processor sharing, J. Ambient Intell. Human. Comput., 14 (2023), 12651–12662. https://doi.org/10.1007/s12652-022-04233-w doi: 10.1007/s12652-022-04233-w
[14]	C. D'Apice, M. P. D'Arienzo, A. N. Dudin, R. Manzo, Admission control in priority queueing system with servers reservation and temporal blocking admission of low priority users, IEEE Access, 11 (2023), 44425–44443. https://doi.org/10.1109/ACCESS.2023.3273148 doi: 10.1109/ACCESS.2023.3273148
[15]	C. D'Apice, M. P. D'Arienzo, A. N. Dudin, R. Manzo, Optimal hysteresis control via a queueing system with two heterogeneous energy-consuming servers, Mathematics, 11 (2023), 4515. https://doi.org/10.3390/math11214515 doi: 10.3390/math11214515
[16]	A. N. Dudin, S. A. Dudin, R. Manzo, L. Rarità, Queueing system with batch arrival of heterogeneous orders, flexible limited processor sharing and dynamical change of priorities, AIMS Math., 9 (2024), 12144–12169. https://doi.org/10.3934/math.2024593 doi: 10.3934/math.2024593
[17]	C. D'Apice, A. N. Dudin, O. S. Dudina, R. Manzo, Analysis of a queueing system with dynamic rating-dependent arrival process and price of service, Mathematics, 12 (2024), 1101. https://doi.org/10.3390/math12071101 doi: 10.3390/math12071101
[18]	S. A. Dudin, A. N. Dudin, R. Manzo, L. Rarità, Analysis of semi-open queueing network with correlated arrival process and multi-server nodes, Oper. Res. Forum, 5 (2024), 99. https://doi.org/10.1007/s43069-024-00383-z doi: 10.1007/s43069-024-00383-z
[19]	C. D'Apice, A. N. Dudin, S. A. Dudin, R. Manzo, Study of a semi-open queueing network with hysteresis control of service regimes, AIMS Math., 10 (2025), 3095–3123. https://doi.org/10.3934/math.2025144 doi: 10.3934/math.2025144
[20]	B. Sun, M. H. Lee, S. A. Dudin, A. N. Dudin, Analysis of multiserver queueing system with opportunistic occupation and reservation of servers, Math. Probl. Eng., 2014 (2014), 178108. https://doi.org/10.1155/2014/178108 doi: 10.1155/2014/178108
[21]	G. Casale, E. Z. Zhang, E. Smirni, Trace data characterization and fitting for Markov modeling, Perform. Evaluation, 67 (2010), 61–79. https://doi.org/10.1016/j.peva.2009.09.003 doi: 10.1016/j.peva.2009.09.003
[22]	P. Buchholz, P. Kemper, J. Kriege, Multi-class Markovian arrival processes and their parameter fitting, Perform. Evaluation, 67 (2010), 1092–1106. https://doi.org/10.1016/j.peva.2010.08.006 doi: 10.1016/j.peva.2010.08.006
[23]	P. Buchholz, A. Panchenko, A two-step EM algorithm for MAP fitting, In: Computer and information sciences-ISCIS 2004, Berlin: Springer, 2004,217–227. https://doi.org/10.1007/978-3-540-30182-0_23
[24]	H. Okamura, T. Dohi, Mapfit: An R-based tool for $PH/MAP$ parameter estimation, In: Quantitative evaluation of systems, Cham: Springer, 2015,105–112. https://doi.org/10.1007/978-3-319-22264-6_7
[25]	H. Okamura, T. Dohi, K. S. Trivedi, Markovian arrival process parameter estimation with group data, IEEE/ACM T. Network., 17 (2009), 1326–1339. https://doi.org/10.1109/TNET.2008.2008750 doi: 10.1109/TNET.2008.2008750
[26]	C. Li, J. J. Zheng, H. Okamura, T. Dohi, Markovian arrival process parameter estimation of quasi-birth-death queueing systems with utilization data, 2026, arXiv: 2607.01914. https://doi.org/10.48550/arXiv.2607.01914
[27]	R. Wang, G. Casale, A. Filieri, Estimating multiclass service demand distributions using Markovian arrival processes, ACM T. Model. Comput. S., 33 (2023), 1–26. https://doi.org/10.1145/3570924 doi: 10.1145/3570924
[28]	M. Brazenas, G. Horvath, M. Telek, Parallel algorithms for fitting Markov arrival processes, Perform. Evaluation, 123 (2018), 50–67. https://doi.org/10.1016/j.peva.2018.05.001 doi: 10.1016/j.peva.2018.05.001
[29]	H. Gumbel, Waiting lines with heterogeneous servers, Oper. Res., 8 (1960), 504–511. https://doi.org/10.1287/opre.8.4.504 doi: 10.1287/opre.8.4.504
[30]	J. H. Kim, H. S. Ahn, R. Righter, Managing queues with heterogeneous servers, J. Appl. Probab., 48 (2011), 435–452. https://doi.org/10.1239/jap/1308662637 doi: 10.1239/jap/1308662637
[31]	C. J. Ancker, A. V. Cafarian, Queuing with reneging and multiple heterogeneous servers, Naval Research Logistics Quarterly, 10 (1963), 125–149. https://doi.org/10.1002/nav.3800100112 doi: 10.1002/nav.3800100112
[32]	V. Saglam, A. Shahbazov, Minimizing loss probability in queuing systems with heterogeneous servers, Iran. J. Sci. Technol. A, 31 (2007), 199–206.
[33]	D. Efrosinin, N. Stepanova, J. Sztrik, A. Plank, Approximations in performance analysis of a controllable queueing system with heterogeneous servers, Mathematics, 8 (2020), 1803. https://doi.org/10.3390/math8101803 doi: 10.3390/math8101803
[34]	A. Gregosiewicz, E. Ratajczyk, L. Stepien, Modeling and simulation of heterogeneous multiserver queues with impatient customers, Adv. Sci. Technol. Res. J., 19 (2025), 464–477. https://doi.org/10.12913/22998624/210352 doi: 10.12913/22998624/210352
[35]	M. Armony, Dynamic routing in large-scale service systems with heterogeneous servers, Queueing Syst., 51 (2005), 287–329. https://doi.org/10.1007/s11134-005-3760-7 doi: 10.1007/s11134-005-3760-7
[36]	M. Armony, A. R. Ward, Fair dynamic routing in large-scale heterogeneous-server systems, Oper. Res., 58 (2010), 624–637. https://doi.org/10.1287/opre.1090.0777 doi: 10.1287/opre.1090.0777
[37]	J. Khamse-Ashari, I. Lambadaris, G. Kesidis, B. Urgaonkar, Y. Q. Zhao, An efficient and fair multi-resource allocation mechanism for heterogeneous servers, IEEE T. Parall. Distr., 29 (2018), 2686-2699. https://doi.org/10.1109/TPDS.2018.2841915 doi: 10.1109/TPDS.2018.2841915
[38]	N. Li, D. A. Stanford, Multi-server accumulating priority queues with heterogeneous servers, Eur. J. Oper. Res., 252 (2016), 866–878. https://doi.org/10.1016/j.ejor.2016.02.010 doi: 10.1016/j.ejor.2016.02.010
[39]	A. Z. Melikov, L. A. Ponomarenko, E. V. Mekhbaliyeva, Analyzing models of systems with heterogeneous servers, Cybern Syst Anal, 56 (2020), 89–99. https://doi.org/10.1007/s10559-020-00224-x doi: 10.1007/s10559-020-00224-x
[40]	L. Sakalauskas, L. Kaklauskas, R. Macaitiene, Stalling in queuing systems with heterogeneous channels, Appl. Sci., 14 (2024), 773. https://doi.org/10.3390/app14020773 doi: 10.3390/app14020773
[41]	V. V. Rykov, Monotone control of queueing systems with heterogeneous servers, Queueing Syst., 37 (2001), 391–403. https://doi.org/10.1023/A:1010893501581 doi: 10.1023/A:1010893501581
[42]	V. Rykov, D. Efrosinin, Optimal control of queueing systems with heterogeneous servers, Queueing Syst., 46 (2004), 389–407. https://doi.org/10.1023/B:QUES.0000027992.91461.1e doi: 10.1023/B:QUES.0000027992.91461.1e
[43]	D. V. Efrosinin, M. P. Farkhadov, N. V. Stepanova, Study of a controllable queueing system with unreliable heterogeneous servers, Autom. Remote Control, 79 (2018), 265–285. https://doi.org/10.1134/S0005117918020066 doi: 10.1134/S0005117918020066
[44]	D. Efrosinin, N. Stepanova, J. Sztrik, Algorithmic analysis of finite-source multi-server heterogeneous queueing systems, Mathematics, 9 (2020), 2624. https://doi.org/10.3390/math9202624 doi: 10.3390/math9202624
[45]	D. V. Efrosinin, V. V. Rykov, Numerical study of the optimal control of a system with heterogeneous servers, Automat. Remote Control, 64 (2003), 302–309. https://doi.org/10.1023/A:1022271316352 doi: 10.1023/A:1022271316352
[46]	D. V. Efrosinin, V. V. Rykov, On performance characteristics for queueing systems with heterogeneous servers, Automat. Remote Control, 69 (2008), 61–75. https://doi.org/10.1134/S0005117908010074 doi: 10.1134/S0005117908010074
[47]	D. Efrosinin, L. Breuer, Threshold policies for controlled retrial queues with heterogeneous servers, Ann. Oper. Res, 141 (2006), 139–162. https://doi.org/10.1007/s10479-006-5297-5 doi: 10.1007/s10479-006-5297-5
[48]	M. B. Combe, Queueing models with dependence structure, PhD Thesis, Tilburg University, 1995.
[49]	Q. M. He, A. S. Alfa, Space reduction for a class of multidimensional Markov chains: A summary and some applications, INFORMS J. Comput., 30 (2018), 1–10. https://doi.org/10.1287/ijoc.2017.0759 doi: 10.1287/ijoc.2017.0759
[50]	A. Graham, Kronecker products and matrix calculus with applications, Mineola: Courier Dover Publications, 2018.
[51]	G. Latouche, V. A. Ramaswami, A logarithmic reduction algorithm for quasi-birth-death processes, J. Appl. Probab., 30 (1993), 650–674. https://doi.org/10.2307/3214773 doi: 10.2307/3214773
[52]	H. Baumann, W. Sandmann, Numerical solution of level dependent quasi-birth-and-death processes, Procedia Computer Science, 1 (2010), 1561–1569. https://doi.org/10.1016/j.procs.2010.04.175 doi: 10.1016/j.procs.2010.04.175
[53]	S. A. Dudin, O. S. Dudina, Call center operation model as a $MAP/PH/N/R- N$ system with impatient customers, Probl. Inf. Transm., 47 (2011), 364–377. https://doi.org/10.1134/S0032946011040053 doi: 10.1134/S0032946011040053
[54]	V. I. Klimenok, A. N. Dudin, Multidimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory, Queueing Syst., 54 (2006), 245–259. https://doi.org/10.1007/s11134-006-0300-z doi: 10.1007/s11134-006-0300-z
[55]	S. A. Dudin, A. N. Dudin, O. S. Dudina, Development of a constructive method for verification of ergodicity and calculation of the stationary distribution of quasi-birth-and-death processes with spatially inhomogeneous transitions, Mathematics, 14 (2026), 1148. https://doi.org/10.3390/math14071148 doi: 10.3390/math14071148

Reader Comments

Your name:*

Email:*
© 2026 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)