2026-05-28T08:54:03Zhttps://riuma.uma.es/rest/oai/request

oai:riuma.uma.es:10630/295102026-02-03T11:19:34Zcom_10630_2254col_10630_37953

An arriving decision problem in a discrete-time queueing system Atencia-McKillop, Iván Galán-García, José Luis Aguilera-Venegas, Gabriel Rodríguez-Cielos, Pedro Galán-García, María Ángeles Colas de espera, Teoría de This paper discusses a discrete-time queueing system in which an arriving customer may adopt four different strategies; two of them correspond to a LCFS discipline where displacements or expulsions occur, and in the other two, the arriving customer decides to follow a FCFS discipline or to become a negative customer eliminating the customer in the server, if any. The different choices of the involved parameters make this model to enjoy a great versatility, having several special cases of interest. We carry out a thorough analysis of the system, and using a generating function approach, we derive analytical results for the stationary distributions obtaining performance measures for the number of customers in the queue and in the system. Also, recursive formulae for calculating the steady-state distributions of the queue and system size has been developed. Making use of the busy period of an auxiliary system, the sojourn times of a customer in the queue and in the system have also been obtained. Finally, some numerical examples are given. 2024-01-31T12:03:20Z 2024-01-31T12:03:20Z 2024-01-31T12:03:20Z 2019-08 journal article Atencia, I., Galán-García, J.L., Aguilera-Venegas, G. et al. An arriving decision problem in a discrete-time queueing system. Adv Comput Math 45, 1863–1879 (2019). https://doi.org/10.1007/s10444-019-09663-3 https://hdl.handle.net/10630/29510 10.1007/s10444-019-09663-3 eng open access Springer