<?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-06-27T12:34:45Z</responseDate><request verb="GetRecord" identifier="oai:docta.ucm.es:20.500.14352/57502" metadataPrefix="mods">https://docta.ucm.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:docta.ucm.es:20.500.14352/57502</identifier><datestamp>2024-03-11T14:10:22Z</datestamp><setSpec>com_20.500.14352_14</setSpec><setSpec>col_20.500.14352_15</setSpec></header><metadata><mods:mods xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
   <mods:name>
      <mods:namePart>Artalejo Rodríguez, Jesús Manuel</mods:namePart>
   </mods:name>
   <mods:extension>
      <mods:dateAvailable encoding="iso8601">2023-06-20T16:57:13Z</mods:dateAvailable>
   </mods:extension>
   <mods:extension>
      <mods:dateAccessioned encoding="iso8601">2023-06-20T16:57:13Z</mods:dateAccessioned>
   </mods:extension>
   <mods:originInfo>
      <mods:dateIssued encoding="iso8601">1995-05</mods:dateIssued>
   </mods:originInfo>
   <mods:identifier type="issn">0167-6377</mods:identifier>
   <mods:identifier type="doi">10.1016/0167-6377(95)00017-E</mods:identifier>
   <mods:identifier type="uri">https://hdl.handle.net/20.500.14352/57502</mods:identifier>
   <mods:identifier type="officialurl">http://www.sciencedirect.com/science/article/pii/016763779500017E</mods:identifier>
   <mods:identifier type="relatedurl">http://www.sciencedirect.com/</mods:identifier>
   <mods:abstract>We consider a queueing system where a customer who finds all channels busy must decide either to join the queue or to retry after an exponentially distributed time. The performance of the system can be approximated by using the RTA approximation introduced by Wolff and Greenberg. We present numerical results demonstrating the performance of the approximation for various representative cases.</mods:abstract>
   <mods:language>
      <mods:languageTerm>eng</mods:languageTerm>
   </mods:language>
   <mods:accessCondition type="useAndReproduction">restricted access</mods:accessCondition>
   <mods:titleInfo>
      <mods:title>A queueing system with returning customers and waiting line</mods:title>
   </mods:titleInfo>
   <mods:genre>journal article</mods:genre>
</mods:mods></metadata></record></GetRecord></OAI-PMH>