Foundations of Queueing Theory:
3. 2 The Busy Period 43 3. 3 The M 1M IS System with Last Come, First Served 50 3. 4 Comparison of FCFS and LCFS 51 3. 5 Time-Reversibility of Markov Processes 52 The Output Process 54 3. 6 3. 7 The Multi-Server System in a Series 55 Problems for Solution 3. 8 56 4 ERLANGIAN QUEUEING SYSTEMS 59 4. 1...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
New York, NY
Springer US
1997
|
| Ausgabe: | 1st ed. 1997 |
| Schriftenreihe: | International Series in Operations Research & Management Science
7 |
| Schlagworte: | |
| Online-Zugang: | BTU01 Volltext |
| Zusammenfassung: | 3. 2 The Busy Period 43 3. 3 The M 1M IS System with Last Come, First Served 50 3. 4 Comparison of FCFS and LCFS 51 3. 5 Time-Reversibility of Markov Processes 52 The Output Process 54 3. 6 3. 7 The Multi-Server System in a Series 55 Problems for Solution 3. 8 56 4 ERLANGIAN QUEUEING SYSTEMS 59 4. 1 Introduction 59 4. 2 The System M I E/c/1 60 4. 3 The System E/cl Mil 67 4. 4 The System MIDI1 72 4. 5 Problems for Solution 74 PRIORITY SYSTEMS 79 5 5. 1 Description of a System with Priorities 79 Two Priority Classes with Pre-emptive Resume Discipline 5. 2 82 5. 3 Two Priority Classes with Head-of-Line Discipline 87 5. 4 Summary of Results 91 5. 5 Optimal Assignment of Priorities 91 5. 6 Problems for Solution 93 6 QUEUEING NETWORKS 97 6. 1 Introduction 97 6. 2 A Markovian Network of Queues 98 6. 3 Closed Networks 103 Open Networks: The Product Formula 104 6. 4 6. 5 Jackson Networks 111 6. 6 Examples of Closed Networks; Cyclic Queues 112 6. 7 Examples of Open Networks 114 6. 8 Problems for Solution 118 7 THE SYSTEM M/G/I; PRIORITY SYSTEMS 123 7. 1 Introduction 123 Contents ix 7. 2 The Waiting Time in MIGI1 124 7. 3 The Sojourn Time and the Queue Length 129 7. 4 The Service Interval 132 7 |
| Beschreibung: | 1 Online-Ressource (XIV, 206 p) |
| ISBN: | 9781461562054 |
| DOI: | 10.1007/978-1-4615-6205-4 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV046873711 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 200828s1997 |||| o||u| ||||||eng d | ||
| 020 | |a 9781461562054 |9 978-1-4615-6205-4 | ||
| 024 | 7 | |a 10.1007/978-1-4615-6205-4 |2 doi | |
| 035 | |a (ZDB-2-SBE)978-1-4615-6205-4 | ||
| 035 | |a (OCoLC)863696396 | ||
| 035 | |a (DE-599)BVBBV046873711 | ||
| 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 721 |0 (DE-625)141612: |2 rvk | ||
| 084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
| 084 | |a SK 820 |0 (DE-625)143258: |2 rvk | ||
| 100 | 1 | |a Prabhu, N.U. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Foundations of Queueing Theory |c by N.U. Prabhu |
| 250 | |a 1st ed. 1997 | ||
| 264 | 1 | |a New York, NY |b Springer US |c 1997 | |
| 300 | |a 1 Online-Ressource (XIV, 206 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a International Series in Operations Research & Management Science |v 7 | |
| 520 | |a 3. 2 The Busy Period 43 3. 3 The M 1M IS System with Last Come, First Served 50 3. 4 Comparison of FCFS and LCFS 51 3. 5 Time-Reversibility of Markov Processes 52 The Output Process 54 3. 6 3. 7 The Multi-Server System in a Series 55 Problems for Solution 3. 8 56 4 ERLANGIAN QUEUEING SYSTEMS 59 4. 1 Introduction 59 4. 2 The System M I E/c/1 60 4. 3 The System E/cl Mil 67 4. 4 The System MIDI1 72 4. 5 Problems for Solution 74 PRIORITY SYSTEMS 79 5 5. 1 Description of a System with Priorities 79 Two Priority Classes with Pre-emptive Resume Discipline 5. 2 82 5. 3 Two Priority Classes with Head-of-Line Discipline 87 5. 4 Summary of Results 91 5. 5 Optimal Assignment of Priorities 91 5. 6 Problems for Solution 93 6 QUEUEING NETWORKS 97 6. 1 Introduction 97 6. 2 A Markovian Network of Queues 98 6. 3 Closed Networks 103 Open Networks: The Product Formula 104 6. 4 6. 5 Jackson Networks 111 6. 6 Examples of Closed Networks; Cyclic Queues 112 6. 7 Examples of Open Networks 114 6. 8 Problems for Solution 118 7 THE SYSTEM M/G/I; PRIORITY SYSTEMS 123 7. 1 Introduction 123 Contents ix 7. 2 The Waiting Time in MIGI1 124 7. 3 The Sojourn Time and the Queue Length 129 7. 4 The Service Interval 132 7 | ||
| 650 | 4 | |a Operations Research/Decision Theory | |
| 650 | 4 | |a Probability Theory and Stochastic Processes | |
| 650 | 4 | |a Operations research | |
| 650 | 4 | |a Decision making | |
| 650 | 4 | |a Probabilities | |
| 650 | 0 | 7 | |a Warteschlangentheorie |0 (DE-588)4255044-0 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Warteschlangentheorie |0 (DE-588)4255044-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780792399629 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781461378457 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781461562061 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4615-6205-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-032283843 | ||
| 966 | e | |u https://doi.org/10.1007/978-1-4615-6205-4 |l BTU01 |p ZDB-2-SBE |q ZDB-2-SBE_Archiv |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804181724161114112 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Prabhu, N.U |
| author_facet | Prabhu, N.U |
| author_role | aut |
| author_sort | Prabhu, N.U |
| author_variant | n p np |
| building | Verbundindex |
| bvnumber | BV046873711 |
| classification_rvk | QH 721 SK 130 SK 820 |
| collection | ZDB-2-SBE ZDB-2-BAE |
| ctrlnum | (ZDB-2-SBE)978-1-4615-6205-4 (OCoLC)863696396 (DE-599)BVBBV046873711 |
| 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-1-4615-6205-4 |
| edition | 1st ed. 1997 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03162nmm a2200541zcb4500</leader><controlfield tag="001">BV046873711</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">200828s1997 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461562054</subfield><subfield code="9">978-1-4615-6205-4</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4615-6205-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SBE)978-1-4615-6205-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)863696396</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046873711</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 721</subfield><subfield code="0">(DE-625)141612:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 130</subfield><subfield code="0">(DE-625)143216:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 820</subfield><subfield code="0">(DE-625)143258:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Prabhu, N.U.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Foundations of Queueing Theory</subfield><subfield code="c">by N.U. Prabhu</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 1997</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">Springer US</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XIV, 206 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">International Series in Operations Research & Management Science</subfield><subfield code="v">7</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">3. 2 The Busy Period 43 3. 3 The M 1M IS System with Last Come, First Served 50 3. 4 Comparison of FCFS and LCFS 51 3. 5 Time-Reversibility of Markov Processes 52 The Output Process 54 3. 6 3. 7 The Multi-Server System in a Series 55 Problems for Solution 3. 8 56 4 ERLANGIAN QUEUEING SYSTEMS 59 4. 1 Introduction 59 4. 2 The System M I E/c/1 60 4. 3 The System E/cl Mil 67 4. 4 The System MIDI1 72 4. 5 Problems for Solution 74 PRIORITY SYSTEMS 79 5 5. 1 Description of a System with Priorities 79 Two Priority Classes with Pre-emptive Resume Discipline 5. 2 82 5. 3 Two Priority Classes with Head-of-Line Discipline 87 5. 4 Summary of Results 91 5. 5 Optimal Assignment of Priorities 91 5. 6 Problems for Solution 93 6 QUEUEING NETWORKS 97 6. 1 Introduction 97 6. 2 A Markovian Network of Queues 98 6. 3 Closed Networks 103 Open Networks: The Product Formula 104 6. 4 6. 5 Jackson Networks 111 6. 6 Examples of Closed Networks; Cyclic Queues 112 6. 7 Examples of Open Networks 114 6. 8 Problems for Solution 118 7 THE SYSTEM M/G/I; PRIORITY SYSTEMS 123 7. 1 Introduction 123 Contents ix 7. 2 The Waiting Time in MIGI1 124 7. 3 The Sojourn Time and the Queue Length 129 7. 4 The Service Interval 132 7</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">Probability Theory and Stochastic Processes</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=" " ind2="4"><subfield code="a">Probabilities</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">Warteschlangentheorie</subfield><subfield code="0">(DE-588)4255044-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" 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">9780792399629</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">9781461378457</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">9781461562061</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4615-6205-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-032283843</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4615-6205-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.BV046873711 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T15:15:39Z |
| indexdate | 2024-07-10T08:56:12Z |
| institution | BVB |
| isbn | 9781461562054 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032283843 |
| oclc_num | 863696396 |
| open_access_boolean | |
| owner | DE-634 |
| owner_facet | DE-634 |
| physical | 1 Online-Ressource (XIV, 206 p) |
| psigel | ZDB-2-SBE ZDB-2-BAE ZDB-2-SBE_Archiv ZDB-2-SBE ZDB-2-SBE_Archiv |
| publishDate | 1997 |
| publishDateSearch | 1997 |
| publishDateSort | 1997 |
| publisher | Springer US |
| record_format | marc |
| series2 | International Series in Operations Research & Management Science |
| spelling | Prabhu, N.U. Verfasser aut Foundations of Queueing Theory by N.U. Prabhu 1st ed. 1997 New York, NY Springer US 1997 1 Online-Ressource (XIV, 206 p) txt rdacontent c rdamedia cr rdacarrier International Series in Operations Research & Management Science 7 3. 2 The Busy Period 43 3. 3 The M 1M IS System with Last Come, First Served 50 3. 4 Comparison of FCFS and LCFS 51 3. 5 Time-Reversibility of Markov Processes 52 The Output Process 54 3. 6 3. 7 The Multi-Server System in a Series 55 Problems for Solution 3. 8 56 4 ERLANGIAN QUEUEING SYSTEMS 59 4. 1 Introduction 59 4. 2 The System M I E/c/1 60 4. 3 The System E/cl Mil 67 4. 4 The System MIDI1 72 4. 5 Problems for Solution 74 PRIORITY SYSTEMS 79 5 5. 1 Description of a System with Priorities 79 Two Priority Classes with Pre-emptive Resume Discipline 5. 2 82 5. 3 Two Priority Classes with Head-of-Line Discipline 87 5. 4 Summary of Results 91 5. 5 Optimal Assignment of Priorities 91 5. 6 Problems for Solution 93 6 QUEUEING NETWORKS 97 6. 1 Introduction 97 6. 2 A Markovian Network of Queues 98 6. 3 Closed Networks 103 Open Networks: The Product Formula 104 6. 4 6. 5 Jackson Networks 111 6. 6 Examples of Closed Networks; Cyclic Queues 112 6. 7 Examples of Open Networks 114 6. 8 Problems for Solution 118 7 THE SYSTEM M/G/I; PRIORITY SYSTEMS 123 7. 1 Introduction 123 Contents ix 7. 2 The Waiting Time in MIGI1 124 7. 3 The Sojourn Time and the Queue Length 129 7. 4 The Service Interval 132 7 Operations Research/Decision Theory Probability Theory and Stochastic Processes Operations research Decision making Probabilities Warteschlangentheorie (DE-588)4255044-0 gnd rswk-swf Warteschlangentheorie (DE-588)4255044-0 s DE-604 Erscheint auch als Druck-Ausgabe 9780792399629 Erscheint auch als Druck-Ausgabe 9781461378457 Erscheint auch als Druck-Ausgabe 9781461562061 https://doi.org/10.1007/978-1-4615-6205-4 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Prabhu, N.U Foundations of Queueing Theory Operations Research/Decision Theory Probability Theory and Stochastic Processes Operations research Decision making Probabilities Warteschlangentheorie (DE-588)4255044-0 gnd |
| subject_GND | (DE-588)4255044-0 |
| title | Foundations of Queueing Theory |
| title_auth | Foundations of Queueing Theory |
| title_exact_search | Foundations of Queueing Theory |
| title_exact_search_txtP | Foundations of Queueing Theory |
| title_full | Foundations of Queueing Theory by N.U. Prabhu |
| title_fullStr | Foundations of Queueing Theory by N.U. Prabhu |
| title_full_unstemmed | Foundations of Queueing Theory by N.U. Prabhu |
| title_short | Foundations of Queueing Theory |
| title_sort | foundations of queueing theory |
| topic | Operations Research/Decision Theory Probability Theory and Stochastic Processes Operations research Decision making Probabilities Warteschlangentheorie (DE-588)4255044-0 gnd |
| topic_facet | Operations Research/Decision Theory Probability Theory and Stochastic Processes Operations research Decision making Probabilities Warteschlangentheorie |
| url | https://doi.org/10.1007/978-1-4615-6205-4 |
| work_keys_str_mv | AT prabhunu foundationsofqueueingtheory |