On the optimal control of two queues with server setup times and its analysis

Two queues are fed by independent, time-homogeneous Poisson arrival processes. One server is available to handle both. All service durations, in both queues, are drawn independently from the same distribution. A setup time is incurred whenever the server moves (switches) from one queue to the other....

Full description

Saved in:
Bibliographic Details
Published in:SIAM journal on computing 1987-04, Vol.16 (2), p.399-420
Main Authors: HOFRI, M, ROSS, K. W
Format: Article
Language:English
Subjects:
Applied mathematics
Applied sciences
Computer science
control theory
systems
Costs
Customer services
Exact sciences and technology
Mathematical models
Simulation
Software
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c194t-acb23fc88aa259c437a42ea91a7e97276a5affef95c6bd142babc2776a22d0443
cites cdi_FETCH-LOGICAL-c194t-acb23fc88aa259c437a42ea91a7e97276a5affef95c6bd142babc2776a22d0443
container_end_page 420
container_issue 2
container_start_page 399
container_title SIAM journal on computing
container_volume 16
creator HOFRI, M
ROSS, K. W
description Two queues are fed by independent, time-homogeneous Poisson arrival processes. One server is available to handle both. All service durations, in both queues, are drawn independently from the same distribution. A setup time is incurred whenever the server moves (switches) from one queue to the other. We prove that in order to minimize the sum of discounted setup charges and holdings costs, assumed linear in queue length and having the same rate at the two queues, the service at each queue should be exhaustive, A "threshold policy" is defined as a policy under which the server switches (from an empty queue) only when the other reaches a critical size. It is shown to be a likely candidate for the optimal policy, both for the discounted version and for the long-time average criterion. The steady-state performance of this policy (under somewhat more general distributional assumptions) and the optimal thresholds are determined for a number of cases.
doi_str_mv 10.1137/0216029
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_919837406</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2578649521</sourcerecordid><originalsourceid>FETCH-LOGICAL-c194t-acb23fc88aa259c437a42ea91a7e97276a5affef95c6bd142babc2776a22d0443</originalsourceid><addsrcrecordid>eNo9kE1LAzEYhIMoWKv4F4IInlbzJtnN5ijFL6j0oufl3TShW9bNmmQt_fdGWjwNDA_DzBByDeweQKgHxqFiXJ-QGTBdFgoATsmMMa2KUmh1Ti5i3DIGUoKYkffVQNPGUj-m7gt7avyQgu-pdzTtPP2e7GQj3XVpQ6MNPzZkSdNIM519HNa0S3-K_T528ZKcOeyjvTrqnHw-P30sXovl6uVt8bgsDGiZCjQtF87UNSIvtZFCoeQWNaCyWnFVYYnOWadLU7VrkLzF1nCVfc7XTEoxJzeH3DH4XDGmZuunkEvERoOuhZKsytDdATLBxxisa8aQN4Z9A6z5u6o5XpXJ22McRoO9CziYLv7jtSjrSjHxCyd2Z5o</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>919837406</pqid></control><display><type>article</type><title>On the optimal control of two queues with server setup times and its analysis</title><source>SIAM Journals Archive</source><source>ABI/INFORM Collection</source><creator>HOFRI, M ; ROSS, K. W</creator><creatorcontrib>HOFRI, M ; ROSS, K. W</creatorcontrib><description>Two queues are fed by independent, time-homogeneous Poisson arrival processes. One server is available to handle both. All service durations, in both queues, are drawn independently from the same distribution. A setup time is incurred whenever the server moves (switches) from one queue to the other. We prove that in order to minimize the sum of discounted setup charges and holdings costs, assumed linear in queue length and having the same rate at the two queues, the service at each queue should be exhaustive, A "threshold policy" is defined as a policy under which the server switches (from an empty queue) only when the other reaches a critical size. It is shown to be a likely candidate for the optimal policy, both for the discounted version and for the long-time average criterion. The steady-state performance of this policy (under somewhat more general distributional assumptions) and the optimal thresholds are determined for a number of cases.</description><identifier>ISSN: 0097-5397</identifier><identifier>EISSN: 1095-7111</identifier><identifier>DOI: 10.1137/0216029</identifier><language>eng</language><publisher>Philadelphia, PA: Society for Industrial and Applied Mathematics</publisher><subject>Applied mathematics ; Applied sciences ; Computer science; control theory; systems ; Costs ; Customer services ; Exact sciences and technology ; Mathematical models ; Simulation ; Software</subject><ispartof>SIAM journal on computing, 1987-04, Vol.16 (2), p.399-420</ispartof><rights>1987 INIST-CNRS</rights><rights>[Copyright] © 1987 Society for Industrial and Applied Mathematics</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c194t-acb23fc88aa259c437a42ea91a7e97276a5affef95c6bd142babc2776a22d0443</citedby><cites>FETCH-LOGICAL-c194t-acb23fc88aa259c437a42ea91a7e97276a5affef95c6bd142babc2776a22d0443</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/919837406?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,776,780,3172,11667,27901,27902,36037,44339</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=8358670$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>HOFRI, M</creatorcontrib><creatorcontrib>ROSS, K. W</creatorcontrib><title>On the optimal control of two queues with server setup times and its analysis</title><title>SIAM journal on computing</title><description>Two queues are fed by independent, time-homogeneous Poisson arrival processes. One server is available to handle both. All service durations, in both queues, are drawn independently from the same distribution. A setup time is incurred whenever the server moves (switches) from one queue to the other. We prove that in order to minimize the sum of discounted setup charges and holdings costs, assumed linear in queue length and having the same rate at the two queues, the service at each queue should be exhaustive, A "threshold policy" is defined as a policy under which the server switches (from an empty queue) only when the other reaches a critical size. It is shown to be a likely candidate for the optimal policy, both for the discounted version and for the long-time average criterion. The steady-state performance of this policy (under somewhat more general distributional assumptions) and the optimal thresholds are determined for a number of cases.</description><subject>Applied mathematics</subject><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Costs</subject><subject>Customer services</subject><subject>Exact sciences and technology</subject><subject>Mathematical models</subject><subject>Simulation</subject><subject>Software</subject><issn>0097-5397</issn><issn>1095-7111</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1987</creationdate><recordtype>article</recordtype><sourceid>M0C</sourceid><recordid>eNo9kE1LAzEYhIMoWKv4F4IInlbzJtnN5ijFL6j0oufl3TShW9bNmmQt_fdGWjwNDA_DzBByDeweQKgHxqFiXJ-QGTBdFgoATsmMMa2KUmh1Ti5i3DIGUoKYkffVQNPGUj-m7gt7avyQgu-pdzTtPP2e7GQj3XVpQ6MNPzZkSdNIM519HNa0S3-K_T528ZKcOeyjvTrqnHw-P30sXovl6uVt8bgsDGiZCjQtF87UNSIvtZFCoeQWNaCyWnFVYYnOWadLU7VrkLzF1nCVfc7XTEoxJzeH3DH4XDGmZuunkEvERoOuhZKsytDdATLBxxisa8aQN4Z9A6z5u6o5XpXJ22McRoO9CziYLv7jtSjrSjHxCyd2Z5o</recordid><startdate>19870401</startdate><enddate>19870401</enddate><creator>HOFRI, M</creator><creator>ROSS, K. W</creator><general>Society for Industrial and Applied Mathematics</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7RQ</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X2</scope><scope>7XB</scope><scope>87Z</scope><scope>88A</scope><scope>88F</scope><scope>88I</scope><scope>88K</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FH</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>ATCPS</scope><scope>AZQEC</scope><scope>BBNVY</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>BHPHI</scope><scope>CCPQU</scope><scope>D1I</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>KB.</scope><scope>L.-</scope><scope>L6V</scope><scope>LK8</scope><scope>M0C</scope><scope>M0K</scope><scope>M0N</scope><scope>M1Q</scope><scope>M2O</scope><scope>M2P</scope><scope>M2T</scope><scope>M7P</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PATMY</scope><scope>PDBOC</scope><scope>PHGZM</scope><scope>PHGZT</scope><scope>PKEHL</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQGLB</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>PYCSY</scope><scope>Q9U</scope><scope>S0W</scope><scope>U9A</scope></search><sort><creationdate>19870401</creationdate><title>On the optimal control of two queues with server setup times and its analysis</title><author>HOFRI, M ; ROSS, K. W</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c194t-acb23fc88aa259c437a42ea91a7e97276a5affef95c6bd142babc2776a22d0443</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1987</creationdate><topic>Applied mathematics</topic><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Costs</topic><topic>Customer services</topic><topic>Exact sciences and technology</topic><topic>Mathematical models</topic><topic>Simulation</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>HOFRI, M</creatorcontrib><creatorcontrib>ROSS, K. W</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Career and Technical Education (ProQuest Database)</collection><collection>ABI商业信息数据库</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>Agricultural Science Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection</collection><collection>Biology Database (Alumni Edition)</collection><collection>Military Database (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Telecommunications (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Natural Science 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 &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Database‎ (1962 - current)</collection><collection>Agricultural &amp; Environmental Science Collection</collection><collection>ProQuest Central Essentials</collection><collection>Biological Science Collection</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>ProQuest Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest Natural Science Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Materials Science Collection</collection><collection>ProQuest Central</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>ProQuest Materials Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>Biological Sciences</collection><collection>ABI/INFORM Collection</collection><collection>Agricultural Science Database</collection><collection>Computing Database</collection><collection>Military Database</collection><collection>ProQuest Research Library</collection><collection>ProQuest Science Journals</collection><collection>Telecommunications Database</collection><collection>Biological Science Database</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>ProQuest advanced technologies &amp; aerospace journals</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>Environmental Science Database</collection><collection>Materials Science Collection</collection><collection>ProQuest Central (New)</collection><collection>ProQuest One Academic (New)</collection><collection>ProQuest One Academic Middle East (New)</collection><collection>One Business (ProQuest)</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Applied &amp; Life Sciences</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering collection</collection><collection>Environmental Science Collection</collection><collection>ProQuest Central Basic</collection><collection>DELNET Engineering &amp; Technology Collection</collection><jtitle>SIAM journal on computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>HOFRI, M</au><au>ROSS, K. W</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the optimal control of two queues with server setup times and its analysis</atitle><jtitle>SIAM journal on computing</jtitle><date>1987-04-01</date><risdate>1987</risdate><volume>16</volume><issue>2</issue><spage>399</spage><epage>420</epage><pages>399-420</pages><issn>0097-5397</issn><eissn>1095-7111</eissn><abstract>Two queues are fed by independent, time-homogeneous Poisson arrival processes. One server is available to handle both. All service durations, in both queues, are drawn independently from the same distribution. A setup time is incurred whenever the server moves (switches) from one queue to the other. We prove that in order to minimize the sum of discounted setup charges and holdings costs, assumed linear in queue length and having the same rate at the two queues, the service at each queue should be exhaustive, A "threshold policy" is defined as a policy under which the server switches (from an empty queue) only when the other reaches a critical size. It is shown to be a likely candidate for the optimal policy, both for the discounted version and for the long-time average criterion. The steady-state performance of this policy (under somewhat more general distributional assumptions) and the optimal thresholds are determined for a number of cases.</abstract><cop>Philadelphia, PA</cop><pub>Society for Industrial and Applied Mathematics</pub><doi>10.1137/0216029</doi><tpages>22</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0097-5397
ispartof SIAM journal on computing, 1987-04, Vol.16 (2), p.399-420
issn 0097-5397
1095-7111
language eng
recordid cdi_proquest_journals_919837406
source SIAM Journals Archive; ABI/INFORM Collection
subjects Applied mathematics
Applied sciences
Computer science
control theory
systems
Costs
Customer services
Exact sciences and technology
Mathematical models
Simulation
Software
title On the optimal control of two queues with server setup times and its analysis
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-24T02%3A16%3A06IST&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=On%20the%20optimal%20control%20of%20two%20queues%20with%20server%20setup%20times%20and%20its%20analysis&rft.jtitle=SIAM%20journal%20on%20computing&rft.au=HOFRI,%20M&rft.date=1987-04-01&rft.volume=16&rft.issue=2&rft.spage=399&rft.epage=420&rft.pages=399-420&rft.issn=0097-5397&rft.eissn=1095-7111&rft_id=info:doi/10.1137/0216029&rft_dat=%3Cproquest_cross%3E2578649521%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c194t-acb23fc88aa259c437a42ea91a7e97276a5affef95c6bd142babc2776a22d0443%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=919837406&rft_id=info:pmid/&rfr_iscdi=true