Incompleteness of results for the slow-server problem with an unreliable fast server
Efrosinin (Ann Oper Res 202:75–102, 2013 ) examined the optimal allocation of customers in an M / M / 2 queueing system with heterogeneous servers differentiated by their service rates and reliability attributes. Specifically, the faster server is subject to partial or complete failures, and the slo...
Gespeichert in:
| Veröffentlicht in: | Annals of operations research 2015-03, Vol.226 (1), p.741-745 |
|---|---|
| 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 | 745 |
|---|---|
| container_issue | 1 |
| container_start_page | 741 |
| container_title | Annals of operations research |
| container_volume | 226 |
| creator | Özkan, Erhun Kharoufeh, Jeffrey P. |
| description | Efrosinin (Ann Oper Res 202:75–102,
2013
) examined the optimal allocation of customers in an
M
/
M
/
2
queueing system with heterogeneous servers differentiated by their service rates and reliability attributes. Specifically, the faster server is subject to partial or complete failures, and the slower server is perfectly reliable. The objective is to determine an optimal allocation policy that minimizes the long-run average number of customers in the system. The purpose of this note is to show that some key arguments in Efrosinin (
2013
) related to the optimality of a threshold policy are incomplete. |
| doi_str_mv | 10.1007/s10479-014-1615-5 |
| format | Article |
| fullrecord | <record><control><sourceid>gale_proqu</sourceid><recordid>TN_cdi_proquest_journals_1655458451</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A407814814</galeid><sourcerecordid>A407814814</sourcerecordid><originalsourceid>FETCH-LOGICAL-c453t-a40d7091ce65f44fd5d1b6e196e8219876b09d62403123f32669f99443a1e1793</originalsourceid><addsrcrecordid>eNp1kV1rFTEQhhdR8Fj9Ad4FvDU1s_nYzWUpWgsFb-p1yNmdnJOymz1mshb_vTmsYAtKAoHheZLMvE3zHsQlCNF9IhCqs1yA4mBAc_2i2YHuWm6l7F82O9FqxbWU4nXzhuhBCAHQ611zf5uGZT5NWDAhEVsCy0jrVIiFJbNyREbT8sgJ80_M7JSX_YQze4zlyHxia8o4RV9rLHgqbMPeNq-Cnwjf_Tkvmu9fPt9ff-V3325ur6_u-KC0LNwrMXbCwoBGB6XCqEfYGwRrsG_B9p3ZCzuaVgkJrQyyNcYGa5WSHhA6Ky-aD9u99Vs_VqTiHpY1p_qkA6O10r3S8Jc6-AldTGEp2Q9zpMFdKdH1oOqu1OU_qLpGnOOwJAyx1p8JH58I-5XieYAxUTwcCx38SvQchw0f8kKUMbhTjrPPvxwId47QbRG6GqE7R-h0ddrNocqmA-Yn_f1X-g1qcJu8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1655458451</pqid></control><display><type>article</type><title>Incompleteness of results for the slow-server problem with an unreliable fast server</title><source>EBSCOhost Business Source Complete</source><source>SpringerLink Journals - AutoHoldings</source><creator>Özkan, Erhun ; Kharoufeh, Jeffrey P.</creator><creatorcontrib>Özkan, Erhun ; Kharoufeh, Jeffrey P.</creatorcontrib><description>Efrosinin (Ann Oper Res 202:75–102,
2013
) examined the optimal allocation of customers in an
M
/
M
/
2
queueing system with heterogeneous servers differentiated by their service rates and reliability attributes. Specifically, the faster server is subject to partial or complete failures, and the slower server is perfectly reliable. The objective is to determine an optimal allocation policy that minimizes the long-run average number of customers in the system. The purpose of this note is to show that some key arguments in Efrosinin (
2013
) related to the optimality of a threshold policy are incomplete.</description><identifier>ISSN: 0254-5330</identifier><identifier>EISSN: 1572-9338</identifier><identifier>DOI: 10.1007/s10479-014-1615-5</identifier><language>eng</language><publisher>Boston: Springer US</publisher><subject>Business and Management ; Combinatorics ; Control systems ; Customer relationship management ; Customer services ; Dynamic programming ; Failure ; Markov analysis ; Markov processes ; Methods ; Operations research ; Operations Research/Decision Theory ; Query processing ; Servers ; Servers (Computers) ; State failure ; Studies ; Theory of Computation</subject><ispartof>Annals of operations research, 2015-03, Vol.226 (1), p.741-745</ispartof><rights>Springer Science+Business Media New York 2014</rights><rights>COPYRIGHT 2015 Springer</rights><rights>Springer Science+Business Media New York 2015</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c453t-a40d7091ce65f44fd5d1b6e196e8219876b09d62403123f32669f99443a1e1793</citedby><cites>FETCH-LOGICAL-c453t-a40d7091ce65f44fd5d1b6e196e8219876b09d62403123f32669f99443a1e1793</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10479-014-1615-5$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10479-014-1615-5$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Özkan, Erhun</creatorcontrib><creatorcontrib>Kharoufeh, Jeffrey P.</creatorcontrib><title>Incompleteness of results for the slow-server problem with an unreliable fast server</title><title>Annals of operations research</title><addtitle>Ann Oper Res</addtitle><description>Efrosinin (Ann Oper Res 202:75–102,
2013
) examined the optimal allocation of customers in an
M
/
M
/
2
queueing system with heterogeneous servers differentiated by their service rates and reliability attributes. Specifically, the faster server is subject to partial or complete failures, and the slower server is perfectly reliable. The objective is to determine an optimal allocation policy that minimizes the long-run average number of customers in the system. The purpose of this note is to show that some key arguments in Efrosinin (
2013
) related to the optimality of a threshold policy are incomplete.</description><subject>Business and Management</subject><subject>Combinatorics</subject><subject>Control systems</subject><subject>Customer relationship management</subject><subject>Customer services</subject><subject>Dynamic programming</subject><subject>Failure</subject><subject>Markov analysis</subject><subject>Markov processes</subject><subject>Methods</subject><subject>Operations research</subject><subject>Operations Research/Decision Theory</subject><subject>Query processing</subject><subject>Servers</subject><subject>Servers (Computers)</subject><subject>State failure</subject><subject>Studies</subject><subject>Theory of Computation</subject><issn>0254-5330</issn><issn>1572-9338</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>N95</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kV1rFTEQhhdR8Fj9Ad4FvDU1s_nYzWUpWgsFb-p1yNmdnJOymz1mshb_vTmsYAtKAoHheZLMvE3zHsQlCNF9IhCqs1yA4mBAc_2i2YHuWm6l7F82O9FqxbWU4nXzhuhBCAHQ611zf5uGZT5NWDAhEVsCy0jrVIiFJbNyREbT8sgJ80_M7JSX_YQze4zlyHxia8o4RV9rLHgqbMPeNq-Cnwjf_Tkvmu9fPt9ff-V3325ur6_u-KC0LNwrMXbCwoBGB6XCqEfYGwRrsG_B9p3ZCzuaVgkJrQyyNcYGa5WSHhA6Ky-aD9u99Vs_VqTiHpY1p_qkA6O10r3S8Jc6-AldTGEp2Q9zpMFdKdH1oOqu1OU_qLpGnOOwJAyx1p8JH58I-5XieYAxUTwcCx38SvQchw0f8kKUMbhTjrPPvxwId47QbRG6GqE7R-h0ddrNocqmA-Yn_f1X-g1qcJu8</recordid><startdate>20150301</startdate><enddate>20150301</enddate><creator>Özkan, Erhun</creator><creator>Kharoufeh, Jeffrey P.</creator><general>Springer US</general><general>Springer</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>N95</scope><scope>3V.</scope><scope>7TA</scope><scope>7TB</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>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>FR3</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JG9</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>KR7</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M2P</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope></search><sort><creationdate>20150301</creationdate><title>Incompleteness of results for the slow-server problem with an unreliable fast server</title><author>Özkan, Erhun ; Kharoufeh, Jeffrey P.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c453t-a40d7091ce65f44fd5d1b6e196e8219876b09d62403123f32669f99443a1e1793</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Business and Management</topic><topic>Combinatorics</topic><topic>Control systems</topic><topic>Customer relationship management</topic><topic>Customer services</topic><topic>Dynamic programming</topic><topic>Failure</topic><topic>Markov analysis</topic><topic>Markov processes</topic><topic>Methods</topic><topic>Operations research</topic><topic>Operations Research/Decision Theory</topic><topic>Query processing</topic><topic>Servers</topic><topic>Servers (Computers)</topic><topic>State failure</topic><topic>Studies</topic><topic>Theory of Computation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Özkan, Erhun</creatorcontrib><creatorcontrib>Kharoufeh, Jeffrey P.</creatorcontrib><collection>CrossRef</collection><collection>Gale Business: Insights</collection><collection>ProQuest Central (Corporate)</collection><collection>Materials Business File</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Access via ABI/INFORM (ProQuest)</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>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>Engineering Research Database</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>Materials Research Database</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>Civil Engineering Abstracts</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</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>ProQuest Central Basic</collection><jtitle>Annals of operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Özkan, Erhun</au><au>Kharoufeh, Jeffrey P.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Incompleteness of results for the slow-server problem with an unreliable fast server</atitle><jtitle>Annals of operations research</jtitle><stitle>Ann Oper Res</stitle><date>2015-03-01</date><risdate>2015</risdate><volume>226</volume><issue>1</issue><spage>741</spage><epage>745</epage><pages>741-745</pages><issn>0254-5330</issn><eissn>1572-9338</eissn><abstract>Efrosinin (Ann Oper Res 202:75–102,
2013
) examined the optimal allocation of customers in an
M
/
M
/
2
queueing system with heterogeneous servers differentiated by their service rates and reliability attributes. Specifically, the faster server is subject to partial or complete failures, and the slower server is perfectly reliable. The objective is to determine an optimal allocation policy that minimizes the long-run average number of customers in the system. The purpose of this note is to show that some key arguments in Efrosinin (
2013
) related to the optimality of a threshold policy are incomplete.</abstract><cop>Boston</cop><pub>Springer US</pub><doi>10.1007/s10479-014-1615-5</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0254-5330 |
| ispartof | Annals of operations research, 2015-03, Vol.226 (1), p.741-745 |
| issn | 0254-5330 1572-9338 |
| language | eng |
| recordid | cdi_proquest_journals_1655458451 |
| source | EBSCOhost Business Source Complete; SpringerLink Journals - AutoHoldings |
| subjects | Business and Management Combinatorics Control systems Customer relationship management Customer services Dynamic programming Failure Markov analysis Markov processes Methods Operations research Operations Research/Decision Theory Query processing Servers Servers (Computers) State failure Studies Theory of Computation |
| title | Incompleteness of results for the slow-server problem with an unreliable fast server |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T15%3A50%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Incompleteness%20of%20results%20for%20the%20slow-server%20problem%20with%20an%20unreliable%20fast%20server&rft.jtitle=Annals%20of%20operations%20research&rft.au=%C3%96zkan,%20Erhun&rft.date=2015-03-01&rft.volume=226&rft.issue=1&rft.spage=741&rft.epage=745&rft.pages=741-745&rft.issn=0254-5330&rft.eissn=1572-9338&rft_id=info:doi/10.1007/s10479-014-1615-5&rft_dat=%3Cgale_proqu%3EA407814814%3C/gale_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1655458451&rft_id=info:pmid/&rft_galeid=A407814814&rfr_iscdi=true |