Approximate Stochastic Behavior of n-Server Service Systems with Large n:
For many stochastic service systems, service capacities large enough to serve some given customer demand is achieved simply by providing multiple servers of low capacity; for example, toll plazas have many toll collectors, banks have many t- lers, bus lines have many buses, etc. If queueing exists a...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1973
|
| Ausgabe: | 1st ed. 1973 |
| Schriftenreihe: | Lecture Notes in Economics and Mathematical Systems
87 |
| Schlagworte: | |
| Online-Zugang: | BTU01 URL des Erstveröffentlichers |
| Zusammenfassung: | For many stochastic service systems, service capacities large enough to serve some given customer demand is achieved simply by providing multiple servers of low capacity; for example, toll plazas have many toll collectors, banks have many t- lers, bus lines have many buses, etc. If queueing exists and the typical queue size is large compared with the number n of servers, all servers are kept busy most of the time and the service behaves like some "effective" single server wit:l mean se.- vice time lin times that of an actual server. The behavior of the queueing system can be described, at least approximately, by use of known results from the much studied single-channel queueing system. For n» 1 , however, (we are thinking p- ticularlyof cases in which n ~ 10), the system may be rather congested and quite sensitive to variations in demand even when the average queue is small compared with n. The behavior of such a system will, generally, differ quite significantly from any "equivalent" single-server system. The following study deals with what, in the customary classification of queueing systems, is called the G/G/n system; n servers in parallel with independent s- vice times serving a fairly general type of customer arrival process. rhe arrival rate of customers may be time-dependent; particular attention is given to time - pendence typical of a "rush hour" in which the arrival rate has a single maximum possibly exceeding the capacity of the service |
| Beschreibung: | 1 Online-Ressource (VIII, 120 p) |
| ISBN: | 9783642656514 |
| DOI: | 10.1007/978-3-642-65651-4 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV046871973 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 200828s1973 |||| o||u| ||||||eng d | ||
| 020 | |a 9783642656514 |9 978-3-642-65651-4 | ||
| 024 | 7 | |a 10.1007/978-3-642-65651-4 |2 doi | |
| 035 | |a (ZDB-2-SBE)978-3-642-65651-4 | ||
| 035 | |a (OCoLC)863792288 | ||
| 035 | |a (DE-599)BVBBV046871973 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-634 | ||
| 082 | 0 | |a 650 |2 23 | |
| 084 | |a QH 237 |0 (DE-625)141552: |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 Stochastic Behavior of n-Server Service Systems with Large n |c by G. F. Newell |
| 250 | |a 1st ed. 1973 | ||
| 264 | 1 | |a Berlin, Heidelberg |b Springer Berlin Heidelberg |c 1973 | |
| 300 | |a 1 Online-Ressource (VIII, 120 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 87 | |
| 520 | |a For many stochastic service systems, service capacities large enough to serve some given customer demand is achieved simply by providing multiple servers of low capacity; for example, toll plazas have many toll collectors, banks have many t- lers, bus lines have many buses, etc. If queueing exists and the typical queue size is large compared with the number n of servers, all servers are kept busy most of the time and the service behaves like some "effective" single server wit:l mean se.- vice time lin times that of an actual server. The behavior of the queueing system can be described, at least approximately, by use of known results from the much studied single-channel queueing system. For n» 1 , however, (we are thinking p- ticularlyof cases in which n ~ 10), the system may be rather congested and quite sensitive to variations in demand even when the average queue is small compared with n. The behavior of such a system will, generally, differ quite significantly from any "equivalent" single-server system. The following study deals with what, in the customary classification of queueing systems, is called the G/G/n system; n servers in parallel with independent s- vice times serving a fairly general type of customer arrival process. rhe arrival rate of customers may be time-dependent; particular attention is given to time - pendence typical of a "rush hour" in which the arrival rate has a single maximum possibly exceeding the capacity of the service | ||
| 650 | 4 | |a Business and Management, general | |
| 650 | 4 | |a Business | |
| 650 | 4 | |a Management science | |
| 650 | 0 | 7 | |a Warteschlangentheorie |0 (DE-588)4255044-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Warteschlangennetz |0 (DE-588)4225823-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Erneuerungstheorie |0 (DE-588)4152834-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Warteschlange |0 (DE-588)4189150-8 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Warteschlange |0 (DE-588)4189150-8 |D s |
| 689 | 0 | 1 | |a Erneuerungstheorie |0 (DE-588)4152834-7 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Warteschlangentheorie |0 (DE-588)4255044-0 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Warteschlangennetz |0 (DE-588)4225823-6 |D s |
| 689 | 2 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783540063667 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783642656521 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-642-65651-4 |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-032282105 | ||
| 966 | e | |u https://doi.org/10.1007/978-3-642-65651-4 |l BTU01 |p ZDB-2-SBE |q ZDB-2-SBE_Archiv |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804181720404066304 |
|---|---|
| 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 f n gf gfn |
| building | Verbundindex |
| bvnumber | BV046871973 |
| classification_rvk | QH 237 SI 853 SK 800 |
| collection | ZDB-2-SBE ZDB-2-BAE |
| ctrlnum | (ZDB-2-SBE)978-3-642-65651-4 (OCoLC)863792288 (DE-599)BVBBV046871973 |
| dewey-full | 650 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 650 - Management and auxiliary services |
| dewey-raw | 650 |
| dewey-search | 650 |
| dewey-sort | 3650 |
| dewey-tens | 650 - Management and auxiliary services |
| discipline | Mathematik Wirtschaftswissenschaften |
| discipline_str_mv | Mathematik Wirtschaftswissenschaften |
| doi_str_mv | 10.1007/978-3-642-65651-4 |
| edition | 1st ed. 1973 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03729nmm a2200601zcb4500</leader><controlfield tag="001">BV046871973</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">200828s1973 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642656514</subfield><subfield code="9">978-3-642-65651-4</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-642-65651-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SBE)978-3-642-65651-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)863792288</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046871973</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">650</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">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 Stochastic Behavior of n-Server Service Systems with Large n</subfield><subfield code="c">by G. F. Newell</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 1973</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin, Heidelberg</subfield><subfield code="b">Springer Berlin Heidelberg</subfield><subfield code="c">1973</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (VIII, 120 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">87</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">For many stochastic service systems, service capacities large enough to serve some given customer demand is achieved simply by providing multiple servers of low capacity; for example, toll plazas have many toll collectors, banks have many t- lers, bus lines have many buses, etc. If queueing exists and the typical queue size is large compared with the number n of servers, all servers are kept busy most of the time and the service behaves like some "effective" single server wit:l mean se.- vice time lin times that of an actual server. The behavior of the queueing system can be described, at least approximately, by use of known results from the much studied single-channel queueing system. For n» 1 , however, (we are thinking p- ticularlyof cases in which n ~ 10), the system may be rather congested and quite sensitive to variations in demand even when the average queue is small compared with n. The behavior of such a system will, generally, differ quite significantly from any "equivalent" single-server system. The following study deals with what, in the customary classification of queueing systems, is called the G/G/n system; n servers in parallel with independent s- vice times serving a fairly general type of customer arrival process. rhe arrival rate of customers may be time-dependent; particular attention is given to time - pendence typical of a "rush hour" in which the arrival rate has a single maximum possibly exceeding the capacity of the service</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Business and Management, general</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Business</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Management science</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="650" ind1="0" ind2="7"><subfield code="a">Warteschlangennetz</subfield><subfield code="0">(DE-588)4225823-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Erneuerungstheorie</subfield><subfield code="0">(DE-588)4152834-7</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="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">Erneuerungstheorie</subfield><subfield code="0">(DE-588)4152834-7</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="689" ind1="2" ind2="0"><subfield code="a">Warteschlangennetz</subfield><subfield code="0">(DE-588)4225823-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" 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">9783540063667</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">9783642656521</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-642-65651-4</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-032282105</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-65651-4</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.BV046871973 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T15:15:36Z |
| indexdate | 2024-07-10T08:56:08Z |
| institution | BVB |
| isbn | 9783642656514 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032282105 |
| oclc_num | 863792288 |
| open_access_boolean | |
| owner | DE-634 |
| owner_facet | DE-634 |
| physical | 1 Online-Ressource (VIII, 120 p) |
| psigel | ZDB-2-SBE ZDB-2-BAE ZDB-2-SBE_Archiv ZDB-2-SBE ZDB-2-SBE_Archiv |
| publishDate | 1973 |
| publishDateSearch | 1973 |
| publishDateSort | 1973 |
| publisher | Springer Berlin Heidelberg |
| record_format | marc |
| series2 | Lecture Notes in Economics and Mathematical Systems |
| spelling | Newell, G. F. Verfasser aut Approximate Stochastic Behavior of n-Server Service Systems with Large n by G. F. Newell 1st ed. 1973 Berlin, Heidelberg Springer Berlin Heidelberg 1973 1 Online-Ressource (VIII, 120 p) txt rdacontent c rdamedia cr rdacarrier Lecture Notes in Economics and Mathematical Systems 87 For many stochastic service systems, service capacities large enough to serve some given customer demand is achieved simply by providing multiple servers of low capacity; for example, toll plazas have many toll collectors, banks have many t- lers, bus lines have many buses, etc. If queueing exists and the typical queue size is large compared with the number n of servers, all servers are kept busy most of the time and the service behaves like some "effective" single server wit:l mean se.- vice time lin times that of an actual server. The behavior of the queueing system can be described, at least approximately, by use of known results from the much studied single-channel queueing system. For n» 1 , however, (we are thinking p- ticularlyof cases in which n ~ 10), the system may be rather congested and quite sensitive to variations in demand even when the average queue is small compared with n. The behavior of such a system will, generally, differ quite significantly from any "equivalent" single-server system. The following study deals with what, in the customary classification of queueing systems, is called the G/G/n system; n servers in parallel with independent s- vice times serving a fairly general type of customer arrival process. rhe arrival rate of customers may be time-dependent; particular attention is given to time - pendence typical of a "rush hour" in which the arrival rate has a single maximum possibly exceeding the capacity of the service Business and Management, general Business Management science Warteschlangentheorie (DE-588)4255044-0 gnd rswk-swf Warteschlangennetz (DE-588)4225823-6 gnd rswk-swf Erneuerungstheorie (DE-588)4152834-7 gnd rswk-swf Warteschlange (DE-588)4189150-8 gnd rswk-swf Warteschlange (DE-588)4189150-8 s Erneuerungstheorie (DE-588)4152834-7 s DE-604 Warteschlangentheorie (DE-588)4255044-0 s Warteschlangennetz (DE-588)4225823-6 s Erscheint auch als Druck-Ausgabe 9783540063667 Erscheint auch als Druck-Ausgabe 9783642656521 https://doi.org/10.1007/978-3-642-65651-4 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Newell, G. F. Approximate Stochastic Behavior of n-Server Service Systems with Large n Business and Management, general Business Management science Warteschlangentheorie (DE-588)4255044-0 gnd Warteschlangennetz (DE-588)4225823-6 gnd Erneuerungstheorie (DE-588)4152834-7 gnd Warteschlange (DE-588)4189150-8 gnd |
| subject_GND | (DE-588)4255044-0 (DE-588)4225823-6 (DE-588)4152834-7 (DE-588)4189150-8 |
| title | Approximate Stochastic Behavior of n-Server Service Systems with Large n |
| title_auth | Approximate Stochastic Behavior of n-Server Service Systems with Large n |
| title_exact_search | Approximate Stochastic Behavior of n-Server Service Systems with Large n |
| title_exact_search_txtP | Approximate Stochastic Behavior of n-Server Service Systems with Large n |
| title_full | Approximate Stochastic Behavior of n-Server Service Systems with Large n by G. F. Newell |
| title_fullStr | Approximate Stochastic Behavior of n-Server Service Systems with Large n by G. F. Newell |
| title_full_unstemmed | Approximate Stochastic Behavior of n-Server Service Systems with Large n by G. F. Newell |
| title_short | Approximate Stochastic Behavior of n-Server Service Systems with Large n |
| title_sort | approximate stochastic behavior of n server service systems with large n |
| topic | Business and Management, general Business Management science Warteschlangentheorie (DE-588)4255044-0 gnd Warteschlangennetz (DE-588)4225823-6 gnd Erneuerungstheorie (DE-588)4152834-7 gnd Warteschlange (DE-588)4189150-8 gnd |
| topic_facet | Business and Management, general Business Management science Warteschlangentheorie Warteschlangennetz Erneuerungstheorie Warteschlange |
| url | https://doi.org/10.1007/978-3-642-65651-4 |
| work_keys_str_mv | AT newellgf approximatestochasticbehaviorofnserverservicesystemswithlargen |