Analysis of multiserver queues with constant retrial rate
We consider multiserver retrial queues in which the time between two successive repeated attempts is independent of the number of customers applying for service. We study a Markovian model where each arriving customer finding any free server either enters service or leaves the service area and joins...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research 2001-12, Vol.135 (3), p.569-581 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 581 |
|---|---|
| container_issue | 3 |
| container_start_page | 569 |
| container_title | European journal of operational research |
| container_volume | 135 |
| creator | Artalejo, J.R. Gómez-Corral, A. Neuts, M.F. |
| description | We consider multiserver retrial queues in which the time between two successive repeated attempts is independent of the number of customers applying for service. We study a Markovian model where each arriving customer finding any free server either enters service or leaves the service area and joins a pool of unsatisfied customers called `orbit'. This system is analyzed as a quasi-birth-and-death (QBD) process and its main performance characteristics are efficiently computed. |
| doi_str_mv | 10.1016/S0377-2217(00)00330-1 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_204149242</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221700003301</els_id><sourcerecordid>87126582</sourcerecordid><originalsourceid>FETCH-LOGICAL-c503t-5a6d93062bf00cd996334ba023924626591aa7136a387c1891098180cfa234893</originalsourceid><addsrcrecordid>eNqFkEtLAzEUhYMoWB8_QRhc6WL03mSSmaykFF9YcKGuQ5reoSltpyZppf_etJVuDZzczTmHw8fYFcIdAqr7DxB1XXKO9Q3ALYAQUOIR62FT81I1Co5Z72A5ZWcxTgEAJcoe0_2FnW2ij0XXFvPVLPlIYU2h-F7RimLx49OkcN0iJrtIRaAUvJ0VwSa6YCetnUW6_Lvn7Ovp8XPwUg7fn18H_WHpJIhUSqvGWoDioxbAjbVWQlQjC1xoXimupEZraxTKiqZ22GgE3WADrrVcVI0W5-x637sMXR4Vk5l2q5BXR8OhwirX8GySe5MLXYyBWrMMfm7DxiCYLSSzg2S2BAyA2UEymHNv-1ygJblDiPKbdoGiWRthUcj8b7J4xpaPzxJZyyyptJENmkma57aHfRtlHmtPwUTnaeFo7AO5ZMad_2fPL4oOhVM</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204149242</pqid></control><display><type>article</type><title>Analysis of multiserver queues with constant retrial rate</title><source>RePEc</source><source>Elsevier ScienceDirect Journals</source><creator>Artalejo, J.R. ; Gómez-Corral, A. ; Neuts, M.F.</creator><creatorcontrib>Artalejo, J.R. ; Gómez-Corral, A. ; Neuts, M.F.</creatorcontrib><description>We consider multiserver retrial queues in which the time between two successive repeated attempts is independent of the number of customers applying for service. We study a Markovian model where each arriving customer finding any free server either enters service or leaves the service area and joins a pool of unsatisfied customers called `orbit'. This system is analyzed as a quasi-birth-and-death (QBD) process and its main performance characteristics are efficiently computed.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/S0377-2217(00)00330-1</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Customer services ; Markov analysis ; Operations research ; Performance analysis ; Quasi-birth-and-death processes ; Queueing ; Queuing ; Retrial queues ; Studies</subject><ispartof>European journal of operational research, 2001-12, Vol.135 (3), p.569-581</ispartof><rights>2001 Elsevier Science B.V.</rights><rights>Copyright Elsevier Sequoia S.A. Dec 16, 2001</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c503t-5a6d93062bf00cd996334ba023924626591aa7136a387c1891098180cfa234893</citedby><cites>FETCH-LOGICAL-c503t-5a6d93062bf00cd996334ba023924626591aa7136a387c1891098180cfa234893</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0377221700003301$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,3994,27901,27902,65306</link.rule.ids><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a135_3ay_3a2001_3ai_3a3_3ap_3a569-581.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Artalejo, J.R.</creatorcontrib><creatorcontrib>Gómez-Corral, A.</creatorcontrib><creatorcontrib>Neuts, M.F.</creatorcontrib><title>Analysis of multiserver queues with constant retrial rate</title><title>European journal of operational research</title><description>We consider multiserver retrial queues in which the time between two successive repeated attempts is independent of the number of customers applying for service. We study a Markovian model where each arriving customer finding any free server either enters service or leaves the service area and joins a pool of unsatisfied customers called `orbit'. This system is analyzed as a quasi-birth-and-death (QBD) process and its main performance characteristics are efficiently computed.</description><subject>Customer services</subject><subject>Markov analysis</subject><subject>Operations research</subject><subject>Performance analysis</subject><subject>Quasi-birth-and-death processes</subject><subject>Queueing</subject><subject>Queuing</subject><subject>Retrial queues</subject><subject>Studies</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2001</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNqFkEtLAzEUhYMoWB8_QRhc6WL03mSSmaykFF9YcKGuQ5reoSltpyZppf_etJVuDZzczTmHw8fYFcIdAqr7DxB1XXKO9Q3ALYAQUOIR62FT81I1Co5Z72A5ZWcxTgEAJcoe0_2FnW2ij0XXFvPVLPlIYU2h-F7RimLx49OkcN0iJrtIRaAUvJ0VwSa6YCetnUW6_Lvn7Ovp8XPwUg7fn18H_WHpJIhUSqvGWoDioxbAjbVWQlQjC1xoXimupEZraxTKiqZ22GgE3WADrrVcVI0W5-x637sMXR4Vk5l2q5BXR8OhwirX8GySe5MLXYyBWrMMfm7DxiCYLSSzg2S2BAyA2UEymHNv-1ygJblDiPKbdoGiWRthUcj8b7J4xpaPzxJZyyyptJENmkma57aHfRtlHmtPwUTnaeFo7AO5ZMad_2fPL4oOhVM</recordid><startdate>20011216</startdate><enddate>20011216</enddate><creator>Artalejo, J.R.</creator><creator>Gómez-Corral, A.</creator><creator>Neuts, M.F.</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20011216</creationdate><title>Analysis of multiserver queues with constant retrial rate</title><author>Artalejo, J.R. ; Gómez-Corral, A. ; Neuts, M.F.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c503t-5a6d93062bf00cd996334ba023924626591aa7136a387c1891098180cfa234893</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2001</creationdate><topic>Customer services</topic><topic>Markov analysis</topic><topic>Operations research</topic><topic>Performance analysis</topic><topic>Quasi-birth-and-death processes</topic><topic>Queueing</topic><topic>Queuing</topic><topic>Retrial queues</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Artalejo, J.R.</creatorcontrib><creatorcontrib>Gómez-Corral, A.</creatorcontrib><creatorcontrib>Neuts, M.F.</creatorcontrib><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>European journal of operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Artalejo, J.R.</au><au>Gómez-Corral, A.</au><au>Neuts, M.F.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Analysis of multiserver queues with constant retrial rate</atitle><jtitle>European journal of operational research</jtitle><date>2001-12-16</date><risdate>2001</risdate><volume>135</volume><issue>3</issue><spage>569</spage><epage>581</epage><pages>569-581</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>We consider multiserver retrial queues in which the time between two successive repeated attempts is independent of the number of customers applying for service. We study a Markovian model where each arriving customer finding any free server either enters service or leaves the service area and joins a pool of unsatisfied customers called `orbit'. This system is analyzed as a quasi-birth-and-death (QBD) process and its main performance characteristics are efficiently computed.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/S0377-2217(00)00330-1</doi><tpages>13</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0377-2217 |
| ispartof | European journal of operational research, 2001-12, Vol.135 (3), p.569-581 |
| issn | 0377-2217 1872-6860 |
| language | eng |
| recordid | cdi_proquest_journals_204149242 |
| source | RePEc; Elsevier ScienceDirect Journals |
| subjects | Customer services Markov analysis Operations research Performance analysis Quasi-birth-and-death processes Queueing Queuing Retrial queues Studies |
| title | Analysis of multiserver queues with constant retrial rate |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T12%3A19%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Analysis%20of%20multiserver%20queues%20with%20constant%20retrial%20rate&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Artalejo,%20J.R.&rft.date=2001-12-16&rft.volume=135&rft.issue=3&rft.spage=569&rft.epage=581&rft.pages=569-581&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/S0377-2217(00)00330-1&rft_dat=%3Cproquest_cross%3E87126582%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=204149242&rft_id=info:pmid/&rft_els_id=S0377221700003301&rfr_iscdi=true |