Pooling in tandem queueing networks with non-collaborative servers
Abstract This paper considers pooling several adjacent stations in a tandem network of single-server stations with finite buffers. When stations are pooled, we assume that the tasks at those stations are pooled but the servers are not. More specifically, each server at the pooled station picks a job...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Argon, Nilay Tanık [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2017 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media, LLC 2017 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Queueing systems - Springer US, 1986, 87(2017), 3-4 vom: 19. Juli, Seite 345-377 |
|---|---|
| Übergeordnetes Werk: |
volume:87 ; year:2017 ; number:3-4 ; day:19 ; month:07 ; pages:345-377 |
| Links: |
|---|
| DOI / URN: |
10.1007/s11134-017-9543-0 |
|---|
| Katalog-ID: |
OLC2058617037 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2058617037 | ||
| 003 | DE-627 | ||
| 005 | 20230504015835.0 | ||
| 007 | tu | ||
| 008 | 200820s2017 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s11134-017-9543-0 |2 doi | |
| 035 | |a (DE-627)OLC2058617037 | ||
| 035 | |a (DE-He213)s11134-017-9543-0-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 084 | |a 11 |2 ssgn | ||
| 100 | 1 | |a Argon, Nilay Tanık |e verfasserin |0 (orcid)0000-0002-6814-0849 |4 aut | |
| 245 | 1 | 0 | |a Pooling in tandem queueing networks with non-collaborative servers |
| 264 | 1 | |c 2017 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science+Business Media, LLC 2017 | ||
| 520 | |a Abstract This paper considers pooling several adjacent stations in a tandem network of single-server stations with finite buffers. When stations are pooled, we assume that the tasks at those stations are pooled but the servers are not. More specifically, each server at the pooled station picks a job from the incoming buffer of the pooled station and conducts all tasks required for that job at the pooled station before that job is placed in the outgoing buffer. For such a system, we provide sufficient conditions on the buffer capacities and service times under which pooling increases the system throughput by means of sample-path comparisons. Our numerical results suggest that pooling in a tandem line generally improves the system throughput—substantially in many cases. Finally, our analytical and numerical results suggest that pooling servers in addition to tasks results in even larger throughput when service rates are additive and the two systems have the same total number of storage spaces. | ||
| 650 | 4 | |a Tandem queues | |
| 650 | 4 | |a Finite buffers | |
| 650 | 4 | |a Production blocking | |
| 650 | 4 | |a Throughput | |
| 650 | 4 | |a Work-in-process inventory (WIP) | |
| 650 | 4 | |a Sample-path analysis | |
| 650 | 4 | |a Stochastic orders | |
| 700 | 1 | |a Andradóttir, Sigrún |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Queueing systems |d Springer US, 1986 |g 87(2017), 3-4 vom: 19. Juli, Seite 345-377 |w (DE-627)129219673 |w (DE-600)56281-6 |w (DE-576)034178309 |x 0257-0130 |7 nnns |
| 773 | 1 | 8 | |g volume:87 |g year:2017 |g number:3-4 |g day:19 |g month:07 |g pages:345-377 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s11134-017-9543-0 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a GBV_ILN_30 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_2088 | ||
| 951 | |a AR | ||
| 952 | |d 87 |j 2017 |e 3-4 |b 19 |c 07 |h 345-377 | ||
| author_variant |
n t a nt nta s a sa |
|---|---|
| matchkey_str |
article:02570130:2017----::olnitneqeenntokwtnnol |
| hierarchy_sort_str |
2017 |
| publishDate |
2017 |
| allfields |
10.1007/s11134-017-9543-0 doi (DE-627)OLC2058617037 (DE-He213)s11134-017-9543-0-p DE-627 ger DE-627 rakwb eng 004 VZ 11 ssgn Argon, Nilay Tanık verfasserin (orcid)0000-0002-6814-0849 aut Pooling in tandem queueing networks with non-collaborative servers 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2017 Abstract This paper considers pooling several adjacent stations in a tandem network of single-server stations with finite buffers. When stations are pooled, we assume that the tasks at those stations are pooled but the servers are not. More specifically, each server at the pooled station picks a job from the incoming buffer of the pooled station and conducts all tasks required for that job at the pooled station before that job is placed in the outgoing buffer. For such a system, we provide sufficient conditions on the buffer capacities and service times under which pooling increases the system throughput by means of sample-path comparisons. Our numerical results suggest that pooling in a tandem line generally improves the system throughput—substantially in many cases. Finally, our analytical and numerical results suggest that pooling servers in addition to tasks results in even larger throughput when service rates are additive and the two systems have the same total number of storage spaces. Tandem queues Finite buffers Production blocking Throughput Work-in-process inventory (WIP) Sample-path analysis Stochastic orders Andradóttir, Sigrún aut Enthalten in Queueing systems Springer US, 1986 87(2017), 3-4 vom: 19. Juli, Seite 345-377 (DE-627)129219673 (DE-600)56281-6 (DE-576)034178309 0257-0130 nnns volume:87 year:2017 number:3-4 day:19 month:07 pages:345-377 https://doi.org/10.1007/s11134-017-9543-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_30 GBV_ILN_70 GBV_ILN_2088 AR 87 2017 3-4 19 07 345-377 |
| spelling |
10.1007/s11134-017-9543-0 doi (DE-627)OLC2058617037 (DE-He213)s11134-017-9543-0-p DE-627 ger DE-627 rakwb eng 004 VZ 11 ssgn Argon, Nilay Tanık verfasserin (orcid)0000-0002-6814-0849 aut Pooling in tandem queueing networks with non-collaborative servers 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2017 Abstract This paper considers pooling several adjacent stations in a tandem network of single-server stations with finite buffers. When stations are pooled, we assume that the tasks at those stations are pooled but the servers are not. More specifically, each server at the pooled station picks a job from the incoming buffer of the pooled station and conducts all tasks required for that job at the pooled station before that job is placed in the outgoing buffer. For such a system, we provide sufficient conditions on the buffer capacities and service times under which pooling increases the system throughput by means of sample-path comparisons. Our numerical results suggest that pooling in a tandem line generally improves the system throughput—substantially in many cases. Finally, our analytical and numerical results suggest that pooling servers in addition to tasks results in even larger throughput when service rates are additive and the two systems have the same total number of storage spaces. Tandem queues Finite buffers Production blocking Throughput Work-in-process inventory (WIP) Sample-path analysis Stochastic orders Andradóttir, Sigrún aut Enthalten in Queueing systems Springer US, 1986 87(2017), 3-4 vom: 19. Juli, Seite 345-377 (DE-627)129219673 (DE-600)56281-6 (DE-576)034178309 0257-0130 nnns volume:87 year:2017 number:3-4 day:19 month:07 pages:345-377 https://doi.org/10.1007/s11134-017-9543-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_30 GBV_ILN_70 GBV_ILN_2088 AR 87 2017 3-4 19 07 345-377 |
| allfields_unstemmed |
10.1007/s11134-017-9543-0 doi (DE-627)OLC2058617037 (DE-He213)s11134-017-9543-0-p DE-627 ger DE-627 rakwb eng 004 VZ 11 ssgn Argon, Nilay Tanık verfasserin (orcid)0000-0002-6814-0849 aut Pooling in tandem queueing networks with non-collaborative servers 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2017 Abstract This paper considers pooling several adjacent stations in a tandem network of single-server stations with finite buffers. When stations are pooled, we assume that the tasks at those stations are pooled but the servers are not. More specifically, each server at the pooled station picks a job from the incoming buffer of the pooled station and conducts all tasks required for that job at the pooled station before that job is placed in the outgoing buffer. For such a system, we provide sufficient conditions on the buffer capacities and service times under which pooling increases the system throughput by means of sample-path comparisons. Our numerical results suggest that pooling in a tandem line generally improves the system throughput—substantially in many cases. Finally, our analytical and numerical results suggest that pooling servers in addition to tasks results in even larger throughput when service rates are additive and the two systems have the same total number of storage spaces. Tandem queues Finite buffers Production blocking Throughput Work-in-process inventory (WIP) Sample-path analysis Stochastic orders Andradóttir, Sigrún aut Enthalten in Queueing systems Springer US, 1986 87(2017), 3-4 vom: 19. Juli, Seite 345-377 (DE-627)129219673 (DE-600)56281-6 (DE-576)034178309 0257-0130 nnns volume:87 year:2017 number:3-4 day:19 month:07 pages:345-377 https://doi.org/10.1007/s11134-017-9543-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_30 GBV_ILN_70 GBV_ILN_2088 AR 87 2017 3-4 19 07 345-377 |
| allfieldsGer |
10.1007/s11134-017-9543-0 doi (DE-627)OLC2058617037 (DE-He213)s11134-017-9543-0-p DE-627 ger DE-627 rakwb eng 004 VZ 11 ssgn Argon, Nilay Tanık verfasserin (orcid)0000-0002-6814-0849 aut Pooling in tandem queueing networks with non-collaborative servers 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2017 Abstract This paper considers pooling several adjacent stations in a tandem network of single-server stations with finite buffers. When stations are pooled, we assume that the tasks at those stations are pooled but the servers are not. More specifically, each server at the pooled station picks a job from the incoming buffer of the pooled station and conducts all tasks required for that job at the pooled station before that job is placed in the outgoing buffer. For such a system, we provide sufficient conditions on the buffer capacities and service times under which pooling increases the system throughput by means of sample-path comparisons. Our numerical results suggest that pooling in a tandem line generally improves the system throughput—substantially in many cases. Finally, our analytical and numerical results suggest that pooling servers in addition to tasks results in even larger throughput when service rates are additive and the two systems have the same total number of storage spaces. Tandem queues Finite buffers Production blocking Throughput Work-in-process inventory (WIP) Sample-path analysis Stochastic orders Andradóttir, Sigrún aut Enthalten in Queueing systems Springer US, 1986 87(2017), 3-4 vom: 19. Juli, Seite 345-377 (DE-627)129219673 (DE-600)56281-6 (DE-576)034178309 0257-0130 nnns volume:87 year:2017 number:3-4 day:19 month:07 pages:345-377 https://doi.org/10.1007/s11134-017-9543-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_30 GBV_ILN_70 GBV_ILN_2088 AR 87 2017 3-4 19 07 345-377 |
| allfieldsSound |
10.1007/s11134-017-9543-0 doi (DE-627)OLC2058617037 (DE-He213)s11134-017-9543-0-p DE-627 ger DE-627 rakwb eng 004 VZ 11 ssgn Argon, Nilay Tanık verfasserin (orcid)0000-0002-6814-0849 aut Pooling in tandem queueing networks with non-collaborative servers 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2017 Abstract This paper considers pooling several adjacent stations in a tandem network of single-server stations with finite buffers. When stations are pooled, we assume that the tasks at those stations are pooled but the servers are not. More specifically, each server at the pooled station picks a job from the incoming buffer of the pooled station and conducts all tasks required for that job at the pooled station before that job is placed in the outgoing buffer. For such a system, we provide sufficient conditions on the buffer capacities and service times under which pooling increases the system throughput by means of sample-path comparisons. Our numerical results suggest that pooling in a tandem line generally improves the system throughput—substantially in many cases. Finally, our analytical and numerical results suggest that pooling servers in addition to tasks results in even larger throughput when service rates are additive and the two systems have the same total number of storage spaces. Tandem queues Finite buffers Production blocking Throughput Work-in-process inventory (WIP) Sample-path analysis Stochastic orders Andradóttir, Sigrún aut Enthalten in Queueing systems Springer US, 1986 87(2017), 3-4 vom: 19. Juli, Seite 345-377 (DE-627)129219673 (DE-600)56281-6 (DE-576)034178309 0257-0130 nnns volume:87 year:2017 number:3-4 day:19 month:07 pages:345-377 https://doi.org/10.1007/s11134-017-9543-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_30 GBV_ILN_70 GBV_ILN_2088 AR 87 2017 3-4 19 07 345-377 |
| language |
English |
| source |
Enthalten in Queueing systems 87(2017), 3-4 vom: 19. Juli, Seite 345-377 volume:87 year:2017 number:3-4 day:19 month:07 pages:345-377 |
| sourceStr |
Enthalten in Queueing systems 87(2017), 3-4 vom: 19. Juli, Seite 345-377 volume:87 year:2017 number:3-4 day:19 month:07 pages:345-377 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Tandem queues Finite buffers Production blocking Throughput Work-in-process inventory (WIP) Sample-path analysis Stochastic orders |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Queueing systems |
| authorswithroles_txt_mv |
Argon, Nilay Tanık @@aut@@ Andradóttir, Sigrún @@aut@@ |
| publishDateDaySort_date |
2017-07-19T00:00:00Z |
| hierarchy_top_id |
129219673 |
| dewey-sort |
14 |
| id |
OLC2058617037 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2058617037</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504015835.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2017 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11134-017-9543-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2058617037</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11134-017-9543-0-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">11</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Argon, Nilay Tanık</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-6814-0849</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Pooling in tandem queueing networks with non-collaborative servers</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2017</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC 2017</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This paper considers pooling several adjacent stations in a tandem network of single-server stations with finite buffers. When stations are pooled, we assume that the tasks at those stations are pooled but the servers are not. More specifically, each server at the pooled station picks a job from the incoming buffer of the pooled station and conducts all tasks required for that job at the pooled station before that job is placed in the outgoing buffer. For such a system, we provide sufficient conditions on the buffer capacities and service times under which pooling increases the system throughput by means of sample-path comparisons. Our numerical results suggest that pooling in a tandem line generally improves the system throughput—substantially in many cases. Finally, our analytical and numerical results suggest that pooling servers in addition to tasks results in even larger throughput when service rates are additive and the two systems have the same total number of storage spaces.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Tandem queues</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Finite buffers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Production blocking</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Throughput</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Work-in-process inventory (WIP)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sample-path analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Stochastic orders</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Andradóttir, Sigrún</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Queueing systems</subfield><subfield code="d">Springer US, 1986</subfield><subfield code="g">87(2017), 3-4 vom: 19. Juli, Seite 345-377</subfield><subfield code="w">(DE-627)129219673</subfield><subfield code="w">(DE-600)56281-6</subfield><subfield code="w">(DE-576)034178309</subfield><subfield code="x">0257-0130</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:87</subfield><subfield code="g">year:2017</subfield><subfield code="g">number:3-4</subfield><subfield code="g">day:19</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:345-377</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11134-017-9543-0</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">87</subfield><subfield code="j">2017</subfield><subfield code="e">3-4</subfield><subfield code="b">19</subfield><subfield code="c">07</subfield><subfield code="h">345-377</subfield></datafield></record></collection>
|
| author |
Argon, Nilay Tanık |
| spellingShingle |
Argon, Nilay Tanık ddc 004 ssgn 11 misc Tandem queues misc Finite buffers misc Production blocking misc Throughput misc Work-in-process inventory (WIP) misc Sample-path analysis misc Stochastic orders Pooling in tandem queueing networks with non-collaborative servers |
| authorStr |
Argon, Nilay Tanık |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)129219673 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0257-0130 |
| topic_title |
004 VZ 11 ssgn Pooling in tandem queueing networks with non-collaborative servers Tandem queues Finite buffers Production blocking Throughput Work-in-process inventory (WIP) Sample-path analysis Stochastic orders |
| topic |
ddc 004 ssgn 11 misc Tandem queues misc Finite buffers misc Production blocking misc Throughput misc Work-in-process inventory (WIP) misc Sample-path analysis misc Stochastic orders |
| topic_unstemmed |
ddc 004 ssgn 11 misc Tandem queues misc Finite buffers misc Production blocking misc Throughput misc Work-in-process inventory (WIP) misc Sample-path analysis misc Stochastic orders |
| topic_browse |
ddc 004 ssgn 11 misc Tandem queues misc Finite buffers misc Production blocking misc Throughput misc Work-in-process inventory (WIP) misc Sample-path analysis misc Stochastic orders |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Queueing systems |
| hierarchy_parent_id |
129219673 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Queueing systems |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)129219673 (DE-600)56281-6 (DE-576)034178309 |
| title |
Pooling in tandem queueing networks with non-collaborative servers |
| ctrlnum |
(DE-627)OLC2058617037 (DE-He213)s11134-017-9543-0-p |
| title_full |
Pooling in tandem queueing networks with non-collaborative servers |
| author_sort |
Argon, Nilay Tanık |
| journal |
Queueing systems |
| journalStr |
Queueing systems |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2017 |
| contenttype_str_mv |
txt |
| container_start_page |
345 |
| author_browse |
Argon, Nilay Tanık Andradóttir, Sigrún |
| container_volume |
87 |
| class |
004 VZ 11 ssgn |
| format_se |
Aufsätze |
| author-letter |
Argon, Nilay Tanık |
| doi_str_mv |
10.1007/s11134-017-9543-0 |
| normlink |
(ORCID)0000-0002-6814-0849 |
| normlink_prefix_str_mv |
(orcid)0000-0002-6814-0849 |
| dewey-full |
004 |
| title_sort |
pooling in tandem queueing networks with non-collaborative servers |
| title_auth |
Pooling in tandem queueing networks with non-collaborative servers |
| abstract |
Abstract This paper considers pooling several adjacent stations in a tandem network of single-server stations with finite buffers. When stations are pooled, we assume that the tasks at those stations are pooled but the servers are not. More specifically, each server at the pooled station picks a job from the incoming buffer of the pooled station and conducts all tasks required for that job at the pooled station before that job is placed in the outgoing buffer. For such a system, we provide sufficient conditions on the buffer capacities and service times under which pooling increases the system throughput by means of sample-path comparisons. Our numerical results suggest that pooling in a tandem line generally improves the system throughput—substantially in many cases. Finally, our analytical and numerical results suggest that pooling servers in addition to tasks results in even larger throughput when service rates are additive and the two systems have the same total number of storage spaces. © Springer Science+Business Media, LLC 2017 |
| abstractGer |
Abstract This paper considers pooling several adjacent stations in a tandem network of single-server stations with finite buffers. When stations are pooled, we assume that the tasks at those stations are pooled but the servers are not. More specifically, each server at the pooled station picks a job from the incoming buffer of the pooled station and conducts all tasks required for that job at the pooled station before that job is placed in the outgoing buffer. For such a system, we provide sufficient conditions on the buffer capacities and service times under which pooling increases the system throughput by means of sample-path comparisons. Our numerical results suggest that pooling in a tandem line generally improves the system throughput—substantially in many cases. Finally, our analytical and numerical results suggest that pooling servers in addition to tasks results in even larger throughput when service rates are additive and the two systems have the same total number of storage spaces. © Springer Science+Business Media, LLC 2017 |
| abstract_unstemmed |
Abstract This paper considers pooling several adjacent stations in a tandem network of single-server stations with finite buffers. When stations are pooled, we assume that the tasks at those stations are pooled but the servers are not. More specifically, each server at the pooled station picks a job from the incoming buffer of the pooled station and conducts all tasks required for that job at the pooled station before that job is placed in the outgoing buffer. For such a system, we provide sufficient conditions on the buffer capacities and service times under which pooling increases the system throughput by means of sample-path comparisons. Our numerical results suggest that pooling in a tandem line generally improves the system throughput—substantially in many cases. Finally, our analytical and numerical results suggest that pooling servers in addition to tasks results in even larger throughput when service rates are additive and the two systems have the same total number of storage spaces. © Springer Science+Business Media, LLC 2017 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_30 GBV_ILN_70 GBV_ILN_2088 |
| container_issue |
3-4 |
| title_short |
Pooling in tandem queueing networks with non-collaborative servers |
| url |
https://doi.org/10.1007/s11134-017-9543-0 |
| remote_bool |
false |
| author2 |
Andradóttir, Sigrún |
| author2Str |
Andradóttir, Sigrún |
| ppnlink |
129219673 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s11134-017-9543-0 |
| up_date |
2024-07-03T19:29:09.167Z |
| _version_ |
1803587366857736192 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2058617037</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504015835.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2017 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11134-017-9543-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2058617037</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11134-017-9543-0-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">11</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Argon, Nilay Tanık</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-6814-0849</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Pooling in tandem queueing networks with non-collaborative servers</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2017</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC 2017</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This paper considers pooling several adjacent stations in a tandem network of single-server stations with finite buffers. When stations are pooled, we assume that the tasks at those stations are pooled but the servers are not. More specifically, each server at the pooled station picks a job from the incoming buffer of the pooled station and conducts all tasks required for that job at the pooled station before that job is placed in the outgoing buffer. For such a system, we provide sufficient conditions on the buffer capacities and service times under which pooling increases the system throughput by means of sample-path comparisons. Our numerical results suggest that pooling in a tandem line generally improves the system throughput—substantially in many cases. Finally, our analytical and numerical results suggest that pooling servers in addition to tasks results in even larger throughput when service rates are additive and the two systems have the same total number of storage spaces.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Tandem queues</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Finite buffers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Production blocking</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Throughput</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Work-in-process inventory (WIP)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sample-path analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Stochastic orders</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Andradóttir, Sigrún</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Queueing systems</subfield><subfield code="d">Springer US, 1986</subfield><subfield code="g">87(2017), 3-4 vom: 19. Juli, Seite 345-377</subfield><subfield code="w">(DE-627)129219673</subfield><subfield code="w">(DE-600)56281-6</subfield><subfield code="w">(DE-576)034178309</subfield><subfield code="x">0257-0130</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:87</subfield><subfield code="g">year:2017</subfield><subfield code="g">number:3-4</subfield><subfield code="g">day:19</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:345-377</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11134-017-9543-0</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">87</subfield><subfield code="j">2017</subfield><subfield code="e">3-4</subfield><subfield code="b">19</subfield><subfield code="c">07</subfield><subfield code="h">345-377</subfield></datafield></record></collection>
|
| score |
7.3991537 |