Aviso: para depositar documentos, por favor, inicia sesión e identifícate con tu cuenta de correo institucional de la UCM con el botón MI CUENTA UCM. No emplees la opción AUTENTICACIÓN CON CONTRASEÑA
 

On the busy period of the M/G/1 retrial queue

dc.contributor.authorArtalejo Rodríguez, Jesús Manuel
dc.contributor.authorLópez Herrero, María Jesús
dc.date.accessioned2023-06-20T16:55:03Z
dc.date.available2023-06-20T16:55:03Z
dc.date.issued2000-03
dc.descriptionThis research was supported by the European Commission under INTAS Grant no. 96-0828, the Complutense University under Grant no. PR64/99-8501 and the DGICYT under Grant no. PB98-0837. The authors thank the referee for his/her helpful comments on an earlier version of this paper.
dc.description.abstractThe M/G/1 queue with repeated attempts is considered. A customer who finds the server busy, leaves the service area and joins a pool of unsatisfied customers. Each customer in the pool repeats his demand after a random amount of time until he finds the server free. We focus on the busy period L of the M/G/1$ retrial queue. The structure of the busy period and its analysis in terms of Laplace transforms have been discussed by several authors. However, this solution has serious limitations in practice. For instance, we cannot compute the first moments of L by direct differentiation. This paper complements the existing work and provides a direct method of calculation for the second moment of L.
dc.description.departmentDepto. de Estadística e Investigación Operativa
dc.description.facultyFac. de Ciencias Matemáticas
dc.description.refereedTRUE
dc.description.sponsorshipINTAS
dc.description.sponsorshipComplutense University
dc.description.sponsorshipDGICYT
dc.description.statuspub
dc.eprint.idhttps://eprints.ucm.es/id/eprint/15866
dc.identifier.doi10.1002/(SICI)1520-6750(200003)47:2<115::AID-NAV3>3.0.CO;2-C
dc.identifier.issn0894-069X
dc.identifier.officialurlhttp://onlinelibrary.wiley.com/doi/10.1002/%28SICI%291520-6750%28200003%2947:2%3C115::AID-NAV3%3E3.0.CO;2-C/abstract
dc.identifier.relatedurlhttp://onlinelibrary.wiley.com/
dc.identifier.urihttps://hdl.handle.net/20.500.14352/57419
dc.issue.number2
dc.journal.titleNaval Research Logistics (NRL)
dc.language.isoeng
dc.page.final127
dc.page.initial115
dc.publisherJohn Wiley & Sons Inc
dc.relation.projectID96-0828
dc.relation.projectIDPR64/99-8501
dc.relation.projectIDPB98-0837
dc.rights.accessRightsrestricted access
dc.subject.cdu519.8
dc.subject.ucmInvestigación operativa (Matemáticas)
dc.subject.unesco1207 Investigación Operativa
dc.titleOn the busy period of the M/G/1 retrial queue
dc.typejournal article
dc.volume.number47
dcterms.referencesJ.R. Artalejo and G.I. Falin, On the orbit characteristics of the M/G/1 retrial queue, Nav Res Logistics 43 (1996), 1147–1161. J.R. Artalejo, Accessible bibliography on retrial queues, Math Comput Model 30 (1999), 1–6. Q.H. Choo and B. Conolly, New results in the theory of repeated orders queueing systems, J Appl Probab 16 (1979), 631–640. G.I. Falin, A single-line system with secondary orders, Eng Cybernet Rev 17 (1979), 76–83. G.I. Falin, A survey of retrial queues, Queue Syst 7 (1990), 127–167. G.I. Falin, M. Martin, and J.R. Artalejo, Information theoretic approximations for the M/G/1 retrial queue, Acta Inf 31 (1994), 559–571. G.I. Falin and J.G.C. Templeton, Retrial queues, Chapman and Hall, London, 1997. D.D. Kouvatsos, Entropy maximization and queueing network models, Ann Oper Res 48 (1994), 63–126. W.H. Press, S.A. Teukolsky, W.T. Vetterling, and B.P. Flannery, Numerical recipes in Fortran. The art of scientific computing, Cambridge University Press, Cambridge, 1992.
dspace.entity.typePublication
relation.isAuthorOfPublicationdb4b8a04-44b0-48e9-8b2c-c80ffae94799
relation.isAuthorOfPublication64a702cc-f8f5-468f-baeb-e37e92492a68
relation.isAuthorOfPublication.latestForDiscovery64a702cc-f8f5-468f-baeb-e37e92492a68

Download

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
arta52.pdf
Size:
149.86 KB
Format:
Adobe Portable Document Format

Collections