<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-05-27T04:46:09Z</responseDate><request verb="GetRecord" identifier="oai:riuma.uma.es:10630/29510" metadataPrefix="rdf">https://riuma.uma.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:riuma.uma.es:10630/29510</identifier><datestamp>2026-02-03T11:19:34Z</datestamp><setSpec>com_10630_2254</setSpec><setSpec>col_10630_37953</setSpec></header><metadata><rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:ds="http://dspace.org/ds/elements/1.1/" xmlns:ow="http://www.ontoweb.org/ontology/1#" xmlns:rdf="http://www.openarchives.org/OAI/2.0/rdf/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/rdf/ http://www.openarchives.org/OAI/2.0/rdf.xsd">
   <ow:Publication rdf:about="oai:riuma.uma.es:10630/29510">
      <dc:title>An arriving decision problem in a discrete-time queueing system</dc:title>
      <dc:creator>Atencia-McKillop, Iván</dc:creator>
      <dc:creator>Galán-García, José Luis</dc:creator>
      <dc:creator>Aguilera-Venegas, Gabriel</dc:creator>
      <dc:creator>Rodríguez-Cielos, Pedro</dc:creator>
      <dc:creator>Galán-García, María Ángeles</dc:creator>
      <dc:subject>Colas de espera, Teoría de</dc:subject>
      <dc:description>This paper discusses a discrete-time queueing system in which an arriving customer&#xd;
may adopt four different strategies; two of them correspond to a LCFS discipline&#xd;
where displacements or expulsions occur, and in the other two, the arriving customer&#xd;
decides to follow a FCFS discipline or to become a negative customer eliminating the&#xd;
customer in the server, if any. The different choices of the involved parameters make&#xd;
this model to enjoy a great versatility, having several special cases of interest. We&#xd;
carry out a thorough analysis of the system, and using a generating function approach,&#xd;
we derive analytical results for the stationary distributions obtaining performance&#xd;
measures for the number of customers in the queue and in the system. Also, recursive&#xd;
formulae for calculating the steady-state distributions of the queue and system size&#xd;
has been developed. Making use of the busy period of an auxiliary system, the sojourn&#xd;
times of a customer in the queue and in the system have also been obtained. Finally,&#xd;
some numerical examples are given.</dc:description>
      <dc:date>2024-01-31T12:03:20Z</dc:date>
      <dc:date>2024-01-31T12:03:20Z</dc:date>
      <dc:date>2019-08</dc:date>
      <dc:type>journal article</dc:type>
      <dc:identifier>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</dc:identifier>
      <dc:identifier>https://hdl.handle.net/10630/29510</dc:identifier>
      <dc:identifier>10.1007/s10444-019-09663-3</dc:identifier>
      <dc:language>eng</dc:language>
      <dc:rights>open access</dc:rights>
      <dc:publisher>Springer</dc:publisher>
   </ow:Publication>
</rdf:RDF>
</metadata></record></GetRecord></OAI-PMH>