Optimal control of a single server in a finite-population queueing network
We study the optimal dynamic assignment of a single server to multiple stations in a finite-population queueing network. The objective is to maximize the long-run average reward/throughput. We use sample-path comparisons to identify conditions on the network structure and service time distributions...
Gespeichert in:
| Veröffentlicht in: | Queueing systems 2017-02, Vol.85 (1-2), p.149-172 |
|---|---|
| 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 | 172 |
|---|---|
| container_issue | 1-2 |
| container_start_page | 149 |
| container_title | Queueing systems |
| container_volume | 85 |
| creator | Argon, Nilay Tanık Deng, Chao Kulkarni, Vidyadhar G. |
| description | We study the optimal dynamic assignment of a single server to multiple stations in a finite-population queueing network. The objective is to maximize the long-run average reward/throughput. We use sample-path comparisons to identify conditions on the network structure and service time distributions under which the optimal policy is an index policy. This index policy assigns the server to the non-empty station where it takes the shortest amount of time (in some stochastic sense) to complete a job. For example, in a network of multiple parallel stations, the optimal policy assigns the highest priority to the fastest station if service times can be ordered in likelihood ratios. Finally, by means of a numerical study, we test the shortest-expected-remaining-service-time policy on parallel-series networks with three stations and find that this index policy either coincides with the optimal policy or provides a near-optimal performance. |
| doi_str_mv | 10.1007/s11134-016-9507-9 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1884135370</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>4312399271</sourcerecordid><originalsourceid>FETCH-LOGICAL-c349t-c91444602d85ad938a94e058856ccf8222afd8917526b32d6f3c5e312e5d21073</originalsourceid><addsrcrecordid>eNp1kE1LAzEQhoMoWKs_wFvAi5fo5Gs3OUrxk0Iveg4xmy1bt8ma7Cr-e1PqQQRPAzPP-zI8CJ1TuKIA9XWmlHJBgFZES6iJPkAzKmtGtBD8EM2AybpcORyjk5w3AFAxqWfoaTWM3db22MUwptjj2GKLcxfWvcfZpw-fcBfKqu1CN3oyxGHq7djFgN8nP_kC4uDHz5jeTtFRa_vsz37mHL3c3T4vHshydf-4uFkSx4UeidNUCFEBa5S0jebKauFBKiUr51rFGLNtozStJateOWuqljvpOWVeNoxCzefoct87pFh-yKPZdtn5vrfBxykbqpSgXPIaCnrxB93EKYXyXaEqWQwIEIWie8qlmHPyrRlScZK-DAWzs2v2dk2xa3Z2jS4Zts_kwoa1T7-a_w19A2tbey8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1865259404</pqid></control><display><type>article</type><title>Optimal control of a single server in a finite-population queueing network</title><source>SpringerLink Journals - AutoHoldings</source><creator>Argon, Nilay Tanık ; Deng, Chao ; Kulkarni, Vidyadhar G.</creator><creatorcontrib>Argon, Nilay Tanık ; Deng, Chao ; Kulkarni, Vidyadhar G.</creatorcontrib><description>We study the optimal dynamic assignment of a single server to multiple stations in a finite-population queueing network. The objective is to maximize the long-run average reward/throughput. We use sample-path comparisons to identify conditions on the network structure and service time distributions under which the optimal policy is an index policy. This index policy assigns the server to the non-empty station where it takes the shortest amount of time (in some stochastic sense) to complete a job. For example, in a network of multiple parallel stations, the optimal policy assigns the highest priority to the fastest station if service times can be ordered in likelihood ratios. Finally, by means of a numerical study, we test the shortest-expected-remaining-service-time policy on parallel-series networks with three stations and find that this index policy either coincides with the optimal policy or provides a near-optimal performance.</description><identifier>ISSN: 0257-0130</identifier><identifier>EISSN: 1572-9443</identifier><identifier>DOI: 10.1007/s11134-016-9507-9</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Business and Management ; Computer Communication Networks ; Control ; Customer services ; Dynamic tests ; Employment ; Likelihood ratio ; Literature reviews ; Mathematical models ; Networks ; Nurses ; Operations Research/Decision Theory ; Optimization ; Policies ; Population ; Probability Theory and Stochastic Processes ; Queuing ; Scheduling ; Servers ; Servers (computers) ; Service stations ; Stations ; Studies ; Supply Chain Management ; Systems Theory</subject><ispartof>Queueing systems, 2017-02, Vol.85 (1-2), p.149-172</ispartof><rights>Springer Science+Business Media New York 2016</rights><rights>Queueing Systems is a copyright of Springer, 2017.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c349t-c91444602d85ad938a94e058856ccf8222afd8917526b32d6f3c5e312e5d21073</citedby><cites>FETCH-LOGICAL-c349t-c91444602d85ad938a94e058856ccf8222afd8917526b32d6f3c5e312e5d21073</cites><orcidid>0000-0002-6814-0849</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11134-016-9507-9$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11134-016-9507-9$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,777,781,27905,27906,41469,42538,51300</link.rule.ids></links><search><creatorcontrib>Argon, Nilay Tanık</creatorcontrib><creatorcontrib>Deng, Chao</creatorcontrib><creatorcontrib>Kulkarni, Vidyadhar G.</creatorcontrib><title>Optimal control of a single server in a finite-population queueing network</title><title>Queueing systems</title><addtitle>Queueing Syst</addtitle><description>We study the optimal dynamic assignment of a single server to multiple stations in a finite-population queueing network. The objective is to maximize the long-run average reward/throughput. We use sample-path comparisons to identify conditions on the network structure and service time distributions under which the optimal policy is an index policy. This index policy assigns the server to the non-empty station where it takes the shortest amount of time (in some stochastic sense) to complete a job. For example, in a network of multiple parallel stations, the optimal policy assigns the highest priority to the fastest station if service times can be ordered in likelihood ratios. Finally, by means of a numerical study, we test the shortest-expected-remaining-service-time policy on parallel-series networks with three stations and find that this index policy either coincides with the optimal policy or provides a near-optimal performance.</description><subject>Business and Management</subject><subject>Computer Communication Networks</subject><subject>Control</subject><subject>Customer services</subject><subject>Dynamic tests</subject><subject>Employment</subject><subject>Likelihood ratio</subject><subject>Literature reviews</subject><subject>Mathematical models</subject><subject>Networks</subject><subject>Nurses</subject><subject>Operations Research/Decision Theory</subject><subject>Optimization</subject><subject>Policies</subject><subject>Population</subject><subject>Probability Theory and Stochastic Processes</subject><subject>Queuing</subject><subject>Scheduling</subject><subject>Servers</subject><subject>Servers (computers)</subject><subject>Service stations</subject><subject>Stations</subject><subject>Studies</subject><subject>Supply Chain Management</subject><subject>Systems Theory</subject><issn>0257-0130</issn><issn>1572-9443</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNp1kE1LAzEQhoMoWKs_wFvAi5fo5Gs3OUrxk0Iveg4xmy1bt8ma7Cr-e1PqQQRPAzPP-zI8CJ1TuKIA9XWmlHJBgFZES6iJPkAzKmtGtBD8EM2AybpcORyjk5w3AFAxqWfoaTWM3db22MUwptjj2GKLcxfWvcfZpw-fcBfKqu1CN3oyxGHq7djFgN8nP_kC4uDHz5jeTtFRa_vsz37mHL3c3T4vHshydf-4uFkSx4UeidNUCFEBa5S0jebKauFBKiUr51rFGLNtozStJateOWuqljvpOWVeNoxCzefoct87pFh-yKPZdtn5vrfBxykbqpSgXPIaCnrxB93EKYXyXaEqWQwIEIWie8qlmHPyrRlScZK-DAWzs2v2dk2xa3Z2jS4Zts_kwoa1T7-a_w19A2tbey8</recordid><startdate>20170201</startdate><enddate>20170201</enddate><creator>Argon, Nilay Tanık</creator><creator>Deng, Chao</creator><creator>Kulkarni, Vidyadhar G.</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>M2O</scope><scope>M2P</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PADUT</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>PYYUZ</scope><scope>Q9U</scope><orcidid>https://orcid.org/0000-0002-6814-0849</orcidid></search><sort><creationdate>20170201</creationdate><title>Optimal control of a single server in a finite-population queueing network</title><author>Argon, Nilay Tanık ; Deng, Chao ; Kulkarni, Vidyadhar G.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c349t-c91444602d85ad938a94e058856ccf8222afd8917526b32d6f3c5e312e5d21073</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Business and Management</topic><topic>Computer Communication Networks</topic><topic>Control</topic><topic>Customer services</topic><topic>Dynamic tests</topic><topic>Employment</topic><topic>Likelihood ratio</topic><topic>Literature reviews</topic><topic>Mathematical models</topic><topic>Networks</topic><topic>Nurses</topic><topic>Operations Research/Decision Theory</topic><topic>Optimization</topic><topic>Policies</topic><topic>Population</topic><topic>Probability Theory and Stochastic Processes</topic><topic>Queuing</topic><topic>Scheduling</topic><topic>Servers</topic><topic>Servers (computers)</topic><topic>Service stations</topic><topic>Stations</topic><topic>Studies</topic><topic>Supply Chain Management</topic><topic>Systems Theory</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Argon, Nilay Tanık</creatorcontrib><creatorcontrib>Deng, Chao</creatorcontrib><creatorcontrib>Kulkarni, Vidyadhar G.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering 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><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Research Library</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Research Library China</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><jtitle>Queueing systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Argon, Nilay Tanık</au><au>Deng, Chao</au><au>Kulkarni, Vidyadhar G.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal control of a single server in a finite-population queueing network</atitle><jtitle>Queueing systems</jtitle><stitle>Queueing Syst</stitle><date>2017-02-01</date><risdate>2017</risdate><volume>85</volume><issue>1-2</issue><spage>149</spage><epage>172</epage><pages>149-172</pages><issn>0257-0130</issn><eissn>1572-9443</eissn><abstract>We study the optimal dynamic assignment of a single server to multiple stations in a finite-population queueing network. The objective is to maximize the long-run average reward/throughput. We use sample-path comparisons to identify conditions on the network structure and service time distributions under which the optimal policy is an index policy. This index policy assigns the server to the non-empty station where it takes the shortest amount of time (in some stochastic sense) to complete a job. For example, in a network of multiple parallel stations, the optimal policy assigns the highest priority to the fastest station if service times can be ordered in likelihood ratios. Finally, by means of a numerical study, we test the shortest-expected-remaining-service-time policy on parallel-series networks with three stations and find that this index policy either coincides with the optimal policy or provides a near-optimal performance.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11134-016-9507-9</doi><tpages>24</tpages><orcidid>https://orcid.org/0000-0002-6814-0849</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0257-0130 |
| ispartof | Queueing systems, 2017-02, Vol.85 (1-2), p.149-172 |
| issn | 0257-0130 1572-9443 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1884135370 |
| source | SpringerLink Journals - AutoHoldings |
| subjects | Business and Management Computer Communication Networks Control Customer services Dynamic tests Employment Likelihood ratio Literature reviews Mathematical models Networks Nurses Operations Research/Decision Theory Optimization Policies Population Probability Theory and Stochastic Processes Queuing Scheduling Servers Servers (computers) Service stations Stations Studies Supply Chain Management Systems Theory |
| title | Optimal control of a single server in a finite-population queueing network |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T06%3A57%3A43IST&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=Optimal%20control%20of%20a%20single%20server%20in%20a%20finite-population%20queueing%20network&rft.jtitle=Queueing%20systems&rft.au=Argon,%20Nilay%20Tan%C4%B1k&rft.date=2017-02-01&rft.volume=85&rft.issue=1-2&rft.spage=149&rft.epage=172&rft.pages=149-172&rft.issn=0257-0130&rft.eissn=1572-9443&rft_id=info:doi/10.1007/s11134-016-9507-9&rft_dat=%3Cproquest_cross%3E4312399271%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=1865259404&rft_id=info:pmid/&rfr_iscdi=true |