Optimal Order of Servers for Tandem Queues in Light Traffic
We study single-server stations in tandem, in which customers arrive according to a Poisson Process and are to be served at each of two servers. The order of the stations is assumed not to affect the quality of the service customers obtain. Using a light traffic approximation, we select (for various...
Gespeichert in:
Veröffentlicht in: | Management science 1988-04, Vol.34 (4), p.500-508 |
---|---|
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 | 508 |
---|---|
container_issue | 4 |
container_start_page | 500 |
container_title | Management science |
container_volume | 34 |
creator | Greenberg, Betsy S Wolff, Ronald W |
description | We study single-server stations in tandem, in which customers arrive according to a Poisson Process and are to be served at each of two servers. The order of the stations is assumed not to affect the quality of the service customers obtain. Using a light traffic approximation, we select (for various joint distributions of service time) the order of the stations that minimizes expected customer delay. |
doi_str_mv | 10.1287/mnsc.34.4.500 |
format | Article |
fullrecord | <record><control><sourceid>jstor_proqu</sourceid><recordid>TN_cdi_proquest_journals_213163911</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><jstor_id>2631938</jstor_id><sourcerecordid>2631938</sourcerecordid><originalsourceid>FETCH-LOGICAL-c470t-a45df799ada6e3ccae9244f4377a5ea29bb37cd7ea66c6f61e1b43f217cdc4cf3</originalsourceid><addsrcrecordid>eNqF0c-LEzEUB_AgCtbVozcPQUUvTs3vTPAki-6uFIpYzyHNJDZlfm0yXdn_3ldnrSDIHh6BvM98efOC0HNKlpTV-n3XF7_kYimWkpAHaEElU5WUhD5EC0KYrKgh5jF6UsqeEKJrrRbow3qcUudavM5NyHiI-FvINyEXHIeMN65vQoe_HsIhFJx6vEo_dhPeZBdj8k_Ro-jaEp7dnWfo--dPm_PLarW-uDr_uKq80GSqnJBN1Ma4xqnAvXfBMCGi4Fo7GRwz2y3XvtHBKeVVVDTQreCRUbj0wkd-ht7MuWMermGQyXap-NC2rg_DoViuDGWaS4Av_4H74ZB7mM0yyqnihlJAr_6HKDNaG2moBlXNyuehlByiHTPsKd9aSuxx2_a4bcuFFRa2Df7L7HMYgz_h1HdD_i1vLHegubuFoqau4UhQx6sRCkIgqLa7qYOw13cjuuJdG7PrfSqnUK254rUA9mJm-zIN-dRmilPDa2i_m9uph7fsyr1_8HbmO3jjnykH--e7zgFMf-Uvmga9aw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>213163911</pqid></control><display><type>article</type><title>Optimal Order of Servers for Tandem Queues in Light Traffic</title><source>RePEc</source><source>INFORMS PubsOnLine</source><source>Periodicals Index Online</source><source>EBSCOhost Business Source Complete</source><source>JSTOR Archive Collection A-Z Listing</source><creator>Greenberg, Betsy S ; Wolff, Ronald W</creator><creatorcontrib>Greenberg, Betsy S ; Wolff, Ronald W</creatorcontrib><description>We study single-server stations in tandem, in which customers arrive according to a Poisson Process and are to be served at each of two servers. The order of the stations is assumed not to affect the quality of the service customers obtain. Using a light traffic approximation, we select (for various joint distributions of service time) the order of the stations that minimizes expected customer delay.</description><identifier>ISSN: 0025-1909</identifier><identifier>EISSN: 1526-5501</identifier><identifier>DOI: 10.1287/mnsc.34.4.500</identifier><identifier>CODEN: MSCIAM</identifier><language>eng</language><publisher>Linthicum, MD: INFORMS</publisher><subject>Applied sciences ; Approximation ; approximations ; Customer services ; Customers ; Design ; Determinism ; Distribution functions ; Exact sciences and technology ; Heuristics ; Laplace transformation ; Management science ; Mathematical analysis ; Network servers ; Operational research and scientific management ; Operational research. Management science ; Optimal ; queueing system design ; Queuing theory ; Queuing theory. Traffic theory ; series queues ; Servers ; Time dependence ; Traffic</subject><ispartof>Management science, 1988-04, Vol.34 (4), p.500-508</ispartof><rights>Copyright 1988 The Institute of Management Sciences</rights><rights>1988 INIST-CNRS</rights><rights>Copyright Institute for Operations Research and the Management Sciences Apr 1988</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c470t-a45df799ada6e3ccae9244f4377a5ea29bb37cd7ea66c6f61e1b43f217cdc4cf3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/2631938$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://pubsonline.informs.org/doi/full/10.1287/mnsc.34.4.500$$EHTML$$P50$$Ginforms$$H</linktohtml><link.rule.ids>314,780,784,803,3690,4005,27867,27922,27923,58015,58248,62614</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=7736384$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttp://econpapers.repec.org/article/inmormnsc/v_3a34_3ay_3a1988_3ai_3a4_3ap_3a500-508.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Greenberg, Betsy S</creatorcontrib><creatorcontrib>Wolff, Ronald W</creatorcontrib><title>Optimal Order of Servers for Tandem Queues in Light Traffic</title><title>Management science</title><description>We study single-server stations in tandem, in which customers arrive according to a Poisson Process and are to be served at each of two servers. The order of the stations is assumed not to affect the quality of the service customers obtain. Using a light traffic approximation, we select (for various joint distributions of service time) the order of the stations that minimizes expected customer delay.</description><subject>Applied sciences</subject><subject>Approximation</subject><subject>approximations</subject><subject>Customer services</subject><subject>Customers</subject><subject>Design</subject><subject>Determinism</subject><subject>Distribution functions</subject><subject>Exact sciences and technology</subject><subject>Heuristics</subject><subject>Laplace transformation</subject><subject>Management science</subject><subject>Mathematical analysis</subject><subject>Network servers</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Optimal</subject><subject>queueing system design</subject><subject>Queuing theory</subject><subject>Queuing theory. Traffic theory</subject><subject>series queues</subject><subject>Servers</subject><subject>Time dependence</subject><subject>Traffic</subject><issn>0025-1909</issn><issn>1526-5501</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1988</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><sourceid>K30</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNqF0c-LEzEUB_AgCtbVozcPQUUvTs3vTPAki-6uFIpYzyHNJDZlfm0yXdn_3ldnrSDIHh6BvM98efOC0HNKlpTV-n3XF7_kYimWkpAHaEElU5WUhD5EC0KYrKgh5jF6UsqeEKJrrRbow3qcUudavM5NyHiI-FvINyEXHIeMN65vQoe_HsIhFJx6vEo_dhPeZBdj8k_Ro-jaEp7dnWfo--dPm_PLarW-uDr_uKq80GSqnJBN1Ma4xqnAvXfBMCGi4Fo7GRwz2y3XvtHBKeVVVDTQreCRUbj0wkd-ht7MuWMermGQyXap-NC2rg_DoViuDGWaS4Av_4H74ZB7mM0yyqnihlJAr_6HKDNaG2moBlXNyuehlByiHTPsKd9aSuxx2_a4bcuFFRa2Df7L7HMYgz_h1HdD_i1vLHegubuFoqau4UhQx6sRCkIgqLa7qYOw13cjuuJdG7PrfSqnUK254rUA9mJm-zIN-dRmilPDa2i_m9uph7fsyr1_8HbmO3jjnykH--e7zgFMf-Uvmga9aw</recordid><startdate>19880401</startdate><enddate>19880401</enddate><creator>Greenberg, Betsy S</creator><creator>Wolff, Ronald W</creator><general>INFORMS</general><general>Institute of Management Sciences</general><general>Institute for Operations Research and the Management Sciences</general><scope>IQODW</scope><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>K30</scope><scope>PAAUG</scope><scope>PAWHS</scope><scope>PAWZZ</scope><scope>PAXOH</scope><scope>PBHAV</scope><scope>PBQSW</scope><scope>PBYQZ</scope><scope>PCIWU</scope><scope>PCMID</scope><scope>PCZJX</scope><scope>PDGRG</scope><scope>PDWWI</scope><scope>PETMR</scope><scope>PFVGT</scope><scope>PGXDX</scope><scope>PIHIL</scope><scope>PISVA</scope><scope>PJCTQ</scope><scope>PJTMS</scope><scope>PLCHJ</scope><scope>PMHAD</scope><scope>PNQDJ</scope><scope>POUND</scope><scope>PPLAD</scope><scope>PQAPC</scope><scope>PQCAN</scope><scope>PQCMW</scope><scope>PQEME</scope><scope>PQHKH</scope><scope>PQMID</scope><scope>PQNCT</scope><scope>PQNET</scope><scope>PQSCT</scope><scope>PQSET</scope><scope>PSVJG</scope><scope>PVMQY</scope><scope>PZGFC</scope><scope>SAAPM</scope><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X5</scope><scope>7XB</scope><scope>87Z</scope><scope>88C</scope><scope>88G</scope><scope>8A3</scope><scope>8AO</scope><scope>8BJ</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FQK</scope><scope>FRNLG</scope><scope>FYUFA</scope><scope>F~G</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>JBE</scope><scope>K60</scope><scope>K6~</scope><scope>L.-</scope><scope>M0C</scope><scope>M0T</scope><scope>M2M</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PSYQQ</scope><scope>Q9U</scope></search><sort><creationdate>19880401</creationdate><title>Optimal Order of Servers for Tandem Queues in Light Traffic</title><author>Greenberg, Betsy S ; Wolff, Ronald W</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c470t-a45df799ada6e3ccae9244f4377a5ea29bb37cd7ea66c6f61e1b43f217cdc4cf3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1988</creationdate><topic>Applied sciences</topic><topic>Approximation</topic><topic>approximations</topic><topic>Customer services</topic><topic>Customers</topic><topic>Design</topic><topic>Determinism</topic><topic>Distribution functions</topic><topic>Exact sciences and technology</topic><topic>Heuristics</topic><topic>Laplace transformation</topic><topic>Management science</topic><topic>Mathematical analysis</topic><topic>Network servers</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Optimal</topic><topic>queueing system design</topic><topic>Queuing theory</topic><topic>Queuing theory. Traffic theory</topic><topic>series queues</topic><topic>Servers</topic><topic>Time dependence</topic><topic>Traffic</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Greenberg, Betsy S</creatorcontrib><creatorcontrib>Wolff, Ronald W</creatorcontrib><collection>Pascal-Francis</collection><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Periodicals Index Online</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - West</collection><collection>Primary Sources Access (Plan D) - International</collection><collection>Primary Sources Access & Build (Plan A) - MEA</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Midwest</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Northeast</collection><collection>Primary Sources Access (Plan D) - Southeast</collection><collection>Primary Sources Access (Plan D) - North Central</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Southeast</collection><collection>Primary Sources Access (Plan D) - South Central</collection><collection>Primary Sources Access & Build (Plan A) - UK / I</collection><collection>Primary Sources Access (Plan D) - Canada</collection><collection>Primary Sources Access (Plan D) - EMEALA</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - North Central</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - South Central</collection><collection>Primary Sources Access & Build (Plan A) - International</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - International</collection><collection>Primary Sources Access (Plan D) - West</collection><collection>Periodicals Index Online Segments 1-50</collection><collection>Primary Sources Access (Plan D) - APAC</collection><collection>Primary Sources Access (Plan D) - Midwest</collection><collection>Primary Sources Access (Plan D) - MEA</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Canada</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - UK / I</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - EMEALA</collection><collection>Primary Sources Access & Build (Plan A) - APAC</collection><collection>Primary Sources Access & Build (Plan A) - Canada</collection><collection>Primary Sources Access & Build (Plan A) - West</collection><collection>Primary Sources Access & Build (Plan A) - EMEALA</collection><collection>Primary Sources Access (Plan D) - Northeast</collection><collection>Primary Sources Access & Build (Plan A) - Midwest</collection><collection>Primary Sources Access & Build (Plan A) - North Central</collection><collection>Primary Sources Access & Build (Plan A) - Northeast</collection><collection>Primary Sources Access & Build (Plan A) - South Central</collection><collection>Primary Sources Access & Build (Plan A) - Southeast</collection><collection>Primary Sources Access (Plan D) - UK / I</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - APAC</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - MEA</collection><collection>Periodicals Index Online Segment 42</collection><collection>ProQuest Central (Corporate)</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>Entrepreneurship Database</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Healthcare Administration Database (Alumni)</collection><collection>Psychology Database (Alumni)</collection><collection>Entrepreneurship Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>International Bibliography of the Social Sciences (IBSS)</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>International Bibliography of the Social Sciences</collection><collection>Business Premium Collection (Alumni)</collection><collection>Health Research Premium Collection</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>International Bibliography of the Social Sciences</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Global</collection><collection>Healthcare Administration Database</collection><collection>Psychology Database</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>ProQuest One Psychology</collection><collection>ProQuest Central Basic</collection><jtitle>Management science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Greenberg, Betsy S</au><au>Wolff, Ronald W</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal Order of Servers for Tandem Queues in Light Traffic</atitle><jtitle>Management science</jtitle><date>1988-04-01</date><risdate>1988</risdate><volume>34</volume><issue>4</issue><spage>500</spage><epage>508</epage><pages>500-508</pages><issn>0025-1909</issn><eissn>1526-5501</eissn><coden>MSCIAM</coden><abstract>We study single-server stations in tandem, in which customers arrive according to a Poisson Process and are to be served at each of two servers. The order of the stations is assumed not to affect the quality of the service customers obtain. Using a light traffic approximation, we select (for various joint distributions of service time) the order of the stations that minimizes expected customer delay.</abstract><cop>Linthicum, MD</cop><pub>INFORMS</pub><doi>10.1287/mnsc.34.4.500</doi><tpages>9</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0025-1909 |
ispartof | Management science, 1988-04, Vol.34 (4), p.500-508 |
issn | 0025-1909 1526-5501 |
language | eng |
recordid | cdi_proquest_journals_213163911 |
source | RePEc; INFORMS PubsOnLine; Periodicals Index Online; EBSCOhost Business Source Complete; JSTOR Archive Collection A-Z Listing |
subjects | Applied sciences Approximation approximations Customer services Customers Design Determinism Distribution functions Exact sciences and technology Heuristics Laplace transformation Management science Mathematical analysis Network servers Operational research and scientific management Operational research. Management science Optimal queueing system design Queuing theory Queuing theory. Traffic theory series queues Servers Time dependence Traffic |
title | Optimal Order of Servers for Tandem Queues in Light Traffic |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T04%3A39%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-jstor_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimal%20Order%20of%20Servers%20for%20Tandem%20Queues%20in%20Light%20Traffic&rft.jtitle=Management%20science&rft.au=Greenberg,%20Betsy%20S&rft.date=1988-04-01&rft.volume=34&rft.issue=4&rft.spage=500&rft.epage=508&rft.pages=500-508&rft.issn=0025-1909&rft.eissn=1526-5501&rft.coden=MSCIAM&rft_id=info:doi/10.1287/mnsc.34.4.500&rft_dat=%3Cjstor_proqu%3E2631938%3C/jstor_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=213163911&rft_id=info:pmid/&rft_jstor_id=2631938&rfr_iscdi=true |