2026-05-29T23:47:19Zhttps://riuma.uma.es/rest/oai/request

oai:riuma.uma.es:10630/186882026-02-03T12:30:14Zcom_10630_2254col_10630_37959

00925njm 22002777a 4500 dc Atencia-McKillop, Iván author 2019-10-31 This paper considers a discrete-time retrial queueing system with movements. The arriving customers can opt to go directly to the server obtaining immediately their service or to join the orbit. In the first case, if the server is busy, the customer that is in the server is displaced to the orbit. The arrivals follow a geometrical law and the service times are general. We study the Markov chain underlying the considered queueing system obtaining the generating function of the number of customers in the orbit and in the system as well as the stationary distribution of the time that a customer spends in the server. We derive the stochastic decomposition law and as an application we give bounds for the proximity between the steady-state distributions for our queueing system and its corresponding standard system. At time m+ the system can be described by the process (Cm, ξm, Nm) where Cm denotes the state of the server, 0 or 1 according to whether the server is free or busy and Nm the number of repeated customers. If Cm = 1, then ξm represents the remaining service time of the customer currently being served. https://hdl.handle.net/10630/18688 Colas de espera, Teoría de Programación (Gestión) A retrial discrete-time queueing system with actions in the server