Artalejo Rodríguez, Jesús ManuelEconomou, A.López Herrero, María Jesús2023-06-202023-06-2020071091-985610.1287/ijoc.1050.0156https://hdl.handle.net/20.500.14352/49934This paper deals with the maximum number of customers in orbit (and in the system) during a busy period for the M/M/c retrial queue. Determining the distribution for the maximum number of customers in orbit is reduced to computation of certain absorption probabilities. By reducing to the single-server case we arrive at a closed analytic formula. For the multi-server case we develop an efficient algorithmic procedure for computation of this distribution by exploiting the special block-tridiagonal structure of the system. Numerical results illustrate the efficiency of the method and reveal interesting facts concerning the behavior of the M/M/c retrial queue.engAlgorithmic analysis of the maximum queue length in a busy period for the M/M/c retrial queuejournal articlehttp://web.ebscohost.com/ehost/detail?sid=188f50af-a998-4e4e-b658-3bca50a50272%40sessionmgr10&vid=1&hid=17&bdata=Jmxhbmc9ZXMmc2l0ZT1laG9zdC1saXZl#db=bth&AN=24775527http://www.informs.org/restricted access519.248M/M/c retrial queuemaximum orbit sizebusy periodcontinuous-time Markov chaintridiagonallinear systemExtreme valuesInvestigación operativa (Matemáticas)1207 Investigación Operativa