2026-05-31T02:35:32Zhttps://riuma.uma.es/rest/oai/request

oai:riuma.uma.es:10630/317192026-02-03T11:46:22Zcom_10630_2254col_10630_37959

Atencia-McKillop, Iván Galán-García, José Luis Aguilera-Venegas, Gabriel Galán-García, María Ángeles Rodríguez-Cielos, Pedro Padilla-Domínguez, Yolanda Carmen Rodríguez-Padilla, Pablo 2024-06-25T09:28:36Z 2024-06-25T09:28:36Z 2024 https://hdl.handle.net/10630/31719 This paper investigates a discrete-time retrial queueing system wherein arriving customers can choose between adopting a Last-Come-First-Served (LCFS) discipline or joining the orbit. The potential variability in service times, which are considered to be general, is taken into account, and retrial times are governed by an arbitrary distribution. The underlying Markov chain of the queueing system in question has been analyzed. The generating function for the number of customers in both the orbit and the system, along with their respective expected values, has been derived. Recursive formulas for computing the steady-state distribution for the analyzed queueing system and its corresponding standard system are provided. Additionally, recursive formulas for determining the steady-state distribution of both the orbit and the system have been developed. Numerical examples are presented to illustrate the impact of the most signi cant parameters on the behaviour of key characteristics of the system. Finally, in the concluding section, the main research contributions of the paper are discussed. eng open access Sistemas de tiempo discreto Colas de espera, Teoría de A discrete-time retrial queueing system with changes in the service times and retrial times. conference output