Analysis of an M/G/1 Queue with Two Types of Impatient Units
| dc.contributor.author | Artalejo Rodríguez, Jesús Manuel | |
| dc.contributor.author | Martin, M. | |
| dc.date.accessioned | 2023-06-20T16:57:09Z | |
| dc.date.available | 2023-06-20T16:57:09Z | |
| dc.date.issued | 1995-09-03 | |
| dc.description | The authors would like to thank the referee for valuable suggestions that helped to improve the presentation of this paper. | |
| dc.description.abstract | This paper deals with a service system in which the processor must serve two types of impatient units. In the case of blocking, the first type units leave the system whereas the second type units enter a pool and wait to be processed later. We develop an exhaustive analysis of the system including embedded Markov chain, fundamental period and various classical stationary probability distributions. More specificp erformancem easures,s uch as the numbero f lost customersa nd other quantities,a re also considered.T he mathematicaal nalysiso f the model is based on the theory of Markov renewal processes, in Markov chains of M/G/1 type and in expressions of 'Takacs' equation' type. | |
| dc.description.department | Depto. de Estadística e Investigación Operativa | |
| dc.description.faculty | Fac. de Ciencias Matemáticas | |
| dc.description.refereed | TRUE | |
| dc.description.status | pub | |
| dc.eprint.id | https://eprints.ucm.es/id/eprint/16225 | |
| dc.identifier.doi | 10.2307/1428136 | |
| dc.identifier.issn | 0001-8678 | |
| dc.identifier.officialurl | http://www.jstor.org/stable/1428136?origin=JSTOR-pdf& | |
| dc.identifier.relatedurl | http://www.jstor.org/ | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14352/57500 | |
| dc.issue.number | 3 | |
| dc.journal.title | Advances in Applied Probability | |
| dc.language.iso | eng | |
| dc.page.final | 861 | |
| dc.page.initial | 840 | |
| dc.publisher | Applied Probability Trust | |
| dc.rights.accessRights | restricted access | |
| dc.subject.cdu | 519.8 | |
| dc.subject.keyword | Queues with impatient units and repeated attempts | |
| dc.subject.keyword | Takacs equation | |
| dc.subject.keyword | Matrices of M/G/1 type | |
| dc.subject.keyword | Markov renewal processes | |
| dc.subject.ucm | Investigación operativa (Matemáticas) | |
| dc.subject.unesco | 1207 Investigación Operativa | |
| dc.title | Analysis of an M/G/1 Queue with Two Types of Impatient Units | |
| dc.type | journal article | |
| dc.volume.number | 27 | |
| dcterms.references | Artalejo,J. R. and Martin, M. (1994) A maximum entropy analysis of the M/G/1 queue with constant repeated attempts. In Selected Topics on Stochastic Modelling. World Scientific, Singapore. Çinlar, E.(1975) Introduction to Stochastic Processes. Prentice-Hall, Englewood Cliffs, NJ. Cohen, J. W. (1982) The Single Server Queue. North-Holland, Amsterdam. Falin, G., Artalejo, J. R. and Martin, M.(1993) On the single server retrial queue with priority customers. Queueing Systems 14, 439-455. Farahmand, K. (1990) Single line queue with repeated demands. Queueing Systems 6, 223-228. Fayolle, G. (1986) A simple telephone exchange with delayed feedbacks. In Teletraffic Analysis and Computer Performance Evaluation, ed. O. J. Boxma, J. W. Cohen and H. C. Tijms. Elsevier Science,Amsterdam. Hammon, J. L. and O'Reilly, P. J. P. (1986) Performance Analysis of Local Computer Networks. Addison-Wesley, Reading, MA. Neuts, M . F. and Ramalhoto, M. F. (1984) A service model in which the server is required to search for customers. J. Appl. Prob. 21, 157-166. Neuts, M. F. (1989) Structured Stochastic Matrices of M/G/1 Type and their Applications. Marcel Dekker, New York. | |
| dspace.entity.type | Publication | |
| relation.isAuthorOfPublication | db4b8a04-44b0-48e9-8b2c-c80ffae94799 | |
| relation.isAuthorOfPublication.latestForDiscovery | db4b8a04-44b0-48e9-8b2c-c80ffae94799 |
Download
Original bundle
1 - 1 of 1