Approximate Behavior of Tandem Queues:
The following monograph deals with the approximate stochastic behavior of a system consisting of a sequence of servers in series with finite storage between consecutive servers. The methods employ deterministic queueing and diffusion approximations which are valid under conditions in which the stora...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1979
|
| Ausgabe: | 1st ed. 1979 |
| Schriftenreihe: | Lecture Notes in Economics and Mathematical Systems
171 |
| Schlagworte: | |
| Online-Zugang: | BTU01 URL des Erstveröffentlichers |
| Zusammenfassung: | The following monograph deals with the approximate stochastic behavior of a system consisting of a sequence of servers in series with finite storage between consecutive servers. The methods employ deterministic queueing and diffusion approximations which are valid under conditions in which the storages and the queue lengths are typically large compared with 1. One can disregard the fact that the customer counts must be integer valued and treat the queue as if it were a (stochastic) continuous fluid. In these approximations, it is not necessary to describe the detailed probability distribution of service times; it suffices simply to specify the rate of service and the variance rate (the variance of the number served per unit time). Specifically, customers are considered to originate from an infinite reservoir. They first pass through a server with service rate ~O' vari ance rate ~O' into a storage of finite capacity c . They then pass l through a server with service rate ~l' variance rate ~l' into a storage of capacity c ' etc., until finally, after passing through an nth server, 2 they go into an infinite reservoir (disappear). If any jth storage become , n , the service at the j-lth server is interrupted full j = 1, 2, and, of course, if a jth storage becomes empty the jth server is inter rupted; otherwise, services work at their maximum rate |
| Beschreibung: | 1 Online-Ressource (XII, 414 p) |
| ISBN: | 9783642464102 |
| DOI: | 10.1007/978-3-642-46410-2 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV046871330 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 200828s1979 |||| o||u| ||||||eng d | ||
| 020 | |a 9783642464102 |9 978-3-642-46410-2 | ||
| 024 | 7 | |a 10.1007/978-3-642-46410-2 |2 doi | |
| 035 | |a (ZDB-2-SBE)978-3-642-46410-2 | ||
| 035 | |a (OCoLC)863954810 | ||
| 035 | |a (DE-599)BVBBV046871330 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-634 | ||
| 082 | 0 | |a 658.40301 |2 23 | |
| 084 | |a QH 237 |0 (DE-625)141552: |2 rvk | ||
| 084 | |a QH 400 |0 (DE-625)141571: |2 rvk | ||
| 084 | |a SI 853 |0 (DE-625)143200: |2 rvk | ||
| 084 | |a SK 800 |0 (DE-625)143256: |2 rvk | ||
| 100 | 1 | |a Newell, G.F. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Approximate Behavior of Tandem Queues |c by G.F. Newell |
| 250 | |a 1st ed. 1979 | ||
| 264 | 1 | |a Berlin, Heidelberg |b Springer Berlin Heidelberg |c 1979 | |
| 300 | |a 1 Online-Ressource (XII, 414 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Lecture Notes in Economics and Mathematical Systems |v 171 | |
| 520 | |a The following monograph deals with the approximate stochastic behavior of a system consisting of a sequence of servers in series with finite storage between consecutive servers. The methods employ deterministic queueing and diffusion approximations which are valid under conditions in which the storages and the queue lengths are typically large compared with 1. One can disregard the fact that the customer counts must be integer valued and treat the queue as if it were a (stochastic) continuous fluid. In these approximations, it is not necessary to describe the detailed probability distribution of service times; it suffices simply to specify the rate of service and the variance rate (the variance of the number served per unit time). Specifically, customers are considered to originate from an infinite reservoir. They first pass through a server with service rate ~O' vari ance rate ~O' into a storage of finite capacity c . They then pass l through a server with service rate ~l' variance rate ~l' into a storage of capacity c ' etc., until finally, after passing through an nth server, 2 they go into an infinite reservoir (disappear). If any jth storage become , n , the service at the j-lth server is interrupted full j = 1, 2, and, of course, if a jth storage becomes empty the jth server is inter rupted; otherwise, services work at their maximum rate | ||
| 650 | 4 | |a Operations Research/Decision Theory | |
| 650 | 4 | |a Operations research | |
| 650 | 4 | |a Decision making | |
| 650 | 0 | 7 | |a Approximation |0 (DE-588)4002498-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Warteschlange |0 (DE-588)4189150-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Warteschlangentheorie |0 (DE-588)4255044-0 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Warteschlange |0 (DE-588)4189150-8 |D s |
| 689 | 0 | 1 | |a Approximation |0 (DE-588)4002498-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Warteschlangentheorie |0 (DE-588)4255044-0 |D s |
| 689 | 1 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783540095521 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783642464119 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-642-46410-2 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-SBE |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SBE_Archiv | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032281461 | ||
| 966 | e | |u https://doi.org/10.1007/978-3-642-46410-2 |l BTU01 |p ZDB-2-SBE |q ZDB-2-SBE_Archiv |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804181719007363072 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Newell, G.F |
| author_facet | Newell, G.F |
| author_role | aut |
| author_sort | Newell, G.F |
| author_variant | g n gn |
| building | Verbundindex |
| bvnumber | BV046871330 |
| classification_rvk | QH 237 QH 400 SI 853 SK 800 |
| collection | ZDB-2-SBE ZDB-2-BAE |
| ctrlnum | (ZDB-2-SBE)978-3-642-46410-2 (OCoLC)863954810 (DE-599)BVBBV046871330 |
| dewey-full | 658.40301 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 658 - General management |
| dewey-raw | 658.40301 |
| dewey-search | 658.40301 |
| dewey-sort | 3658.40301 |
| dewey-tens | 650 - Management and auxiliary services |
| discipline | Mathematik Wirtschaftswissenschaften |
| discipline_str_mv | Mathematik Wirtschaftswissenschaften |
| doi_str_mv | 10.1007/978-3-642-46410-2 |
| edition | 1st ed. 1979 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03491nmm a2200577zcb4500</leader><controlfield tag="001">BV046871330</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">200828s1979 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642464102</subfield><subfield code="9">978-3-642-46410-2</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-642-46410-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SBE)978-3-642-46410-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)863954810</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046871330</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">658.40301</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 237</subfield><subfield code="0">(DE-625)141552:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 400</subfield><subfield code="0">(DE-625)141571:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 853</subfield><subfield code="0">(DE-625)143200:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 800</subfield><subfield code="0">(DE-625)143256:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Newell, G.F.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Approximate Behavior of Tandem Queues</subfield><subfield code="c">by G.F. Newell</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 1979</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin, Heidelberg</subfield><subfield code="b">Springer Berlin Heidelberg</subfield><subfield code="c">1979</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XII, 414 p)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Lecture Notes in Economics and Mathematical Systems</subfield><subfield code="v">171</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The following monograph deals with the approximate stochastic behavior of a system consisting of a sequence of servers in series with finite storage between consecutive servers. The methods employ deterministic queueing and diffusion approximations which are valid under conditions in which the storages and the queue lengths are typically large compared with 1. One can disregard the fact that the customer counts must be integer valued and treat the queue as if it were a (stochastic) continuous fluid. In these approximations, it is not necessary to describe the detailed probability distribution of service times; it suffices simply to specify the rate of service and the variance rate (the variance of the number served per unit time). Specifically, customers are considered to originate from an infinite reservoir. They first pass through a server with service rate ~O' vari ance rate ~O' into a storage of finite capacity c . They then pass l through a server with service rate ~l' variance rate ~l' into a storage of capacity c ' etc., until finally, after passing through an nth server, 2 they go into an infinite reservoir (disappear). If any jth storage become , n , the service at the j-lth server is interrupted full j = 1, 2, and, of course, if a jth storage becomes empty the jth server is inter rupted; otherwise, services work at their maximum rate</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations Research/Decision Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations research</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Decision making</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximation</subfield><subfield code="0">(DE-588)4002498-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Warteschlange</subfield><subfield code="0">(DE-588)4189150-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Warteschlangentheorie</subfield><subfield code="0">(DE-588)4255044-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Warteschlange</subfield><subfield code="0">(DE-588)4189150-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Approximation</subfield><subfield code="0">(DE-588)4002498-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Warteschlangentheorie</subfield><subfield code="0">(DE-588)4255044-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783540095521</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783642464119</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-642-46410-2</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SBE</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SBE_Archiv</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032281461</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-46410-2</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-SBE</subfield><subfield code="q">ZDB-2-SBE_Archiv</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV046871330 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T15:15:35Z |
| indexdate | 2024-07-10T08:56:07Z |
| institution | BVB |
| isbn | 9783642464102 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032281461 |
| oclc_num | 863954810 |
| open_access_boolean | |
| owner | DE-634 |
| owner_facet | DE-634 |
| physical | 1 Online-Ressource (XII, 414 p) |
| psigel | ZDB-2-SBE ZDB-2-BAE ZDB-2-SBE_Archiv ZDB-2-SBE ZDB-2-SBE_Archiv |
| publishDate | 1979 |
| publishDateSearch | 1979 |
| publishDateSort | 1979 |
| publisher | Springer Berlin Heidelberg |
| record_format | marc |
| series2 | Lecture Notes in Economics and Mathematical Systems |
| spelling | Newell, G.F. Verfasser aut Approximate Behavior of Tandem Queues by G.F. Newell 1st ed. 1979 Berlin, Heidelberg Springer Berlin Heidelberg 1979 1 Online-Ressource (XII, 414 p) txt rdacontent c rdamedia cr rdacarrier Lecture Notes in Economics and Mathematical Systems 171 The following monograph deals with the approximate stochastic behavior of a system consisting of a sequence of servers in series with finite storage between consecutive servers. The methods employ deterministic queueing and diffusion approximations which are valid under conditions in which the storages and the queue lengths are typically large compared with 1. One can disregard the fact that the customer counts must be integer valued and treat the queue as if it were a (stochastic) continuous fluid. In these approximations, it is not necessary to describe the detailed probability distribution of service times; it suffices simply to specify the rate of service and the variance rate (the variance of the number served per unit time). Specifically, customers are considered to originate from an infinite reservoir. They first pass through a server with service rate ~O' vari ance rate ~O' into a storage of finite capacity c . They then pass l through a server with service rate ~l' variance rate ~l' into a storage of capacity c ' etc., until finally, after passing through an nth server, 2 they go into an infinite reservoir (disappear). If any jth storage become , n , the service at the j-lth server is interrupted full j = 1, 2, and, of course, if a jth storage becomes empty the jth server is inter rupted; otherwise, services work at their maximum rate Operations Research/Decision Theory Operations research Decision making Approximation (DE-588)4002498-2 gnd rswk-swf Warteschlange (DE-588)4189150-8 gnd rswk-swf Warteschlangentheorie (DE-588)4255044-0 gnd rswk-swf Warteschlange (DE-588)4189150-8 s Approximation (DE-588)4002498-2 s DE-604 Warteschlangentheorie (DE-588)4255044-0 s Erscheint auch als Druck-Ausgabe 9783540095521 Erscheint auch als Druck-Ausgabe 9783642464119 https://doi.org/10.1007/978-3-642-46410-2 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Newell, G.F Approximate Behavior of Tandem Queues Operations Research/Decision Theory Operations research Decision making Approximation (DE-588)4002498-2 gnd Warteschlange (DE-588)4189150-8 gnd Warteschlangentheorie (DE-588)4255044-0 gnd |
| subject_GND | (DE-588)4002498-2 (DE-588)4189150-8 (DE-588)4255044-0 |
| title | Approximate Behavior of Tandem Queues |
| title_auth | Approximate Behavior of Tandem Queues |
| title_exact_search | Approximate Behavior of Tandem Queues |
| title_exact_search_txtP | Approximate Behavior of Tandem Queues |
| title_full | Approximate Behavior of Tandem Queues by G.F. Newell |
| title_fullStr | Approximate Behavior of Tandem Queues by G.F. Newell |
| title_full_unstemmed | Approximate Behavior of Tandem Queues by G.F. Newell |
| title_short | Approximate Behavior of Tandem Queues |
| title_sort | approximate behavior of tandem queues |
| topic | Operations Research/Decision Theory Operations research Decision making Approximation (DE-588)4002498-2 gnd Warteschlange (DE-588)4189150-8 gnd Warteschlangentheorie (DE-588)4255044-0 gnd |
| topic_facet | Operations Research/Decision Theory Operations research Decision making Approximation Warteschlange Warteschlangentheorie |
| url | https://doi.org/10.1007/978-3-642-46410-2 |
| work_keys_str_mv | AT newellgf approximatebehavioroftandemqueues |