國立虎尾科技大學 |

Introduction to Queueing Networks = Theory ∩ Practice /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Introduction to Queueing Networks/ by J. MacGregor Smith.
其他題名:	Theory ∩ Practice /
作者:	Smith, J. MacGregor.
面頁冊數:	XXV, 562 p. 366 illus., 246 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Mathematical models. -
電子資源:	https://doi.org/10.1007/978-3-319-78822-7
ISBN:	9783319788227

Introduction to Queueing Networks = Theory ∩ Practice /
Smith, J. MacGregor.

Introduction to Queueing NetworksTheory ∩ Practice /[electronic resource] :by J. MacGregor Smith. - 1st ed. 2018. - XXV, 562 p. 366 illus., 246 illus. in color.online resource. - Springer Series in Operations Research and Financial Engineering,1431-8598. - Springer Series in Operations Research and Financial Engineering,.

Introduction G(V,E) -- Problem Overview Ω(G(V,E)) -- Mathematical Models and Properties of Queues G(V) -- Transportation and Loss Queues G(E) -- Open Queueing Network Algorithms f(G(V,E)) -- Closed Queueing Network Performance Models f(G(V,E,N)) -- Optimal Resource Allocation Problems (ORAP) G(V*) in TND -- Optimal Routing Problems (ORTE) G(E*) in TND -- Optimal Topology Problems (OTOP) G(V,E)* in TND -- Final Coda.

The book examines the performance and optimization of systems where queueing and congestion are important constructs. Both finite and infinite queueing systems are examined. Many examples and case studies are utilized to indicate the breadth and depth of the queueing systems and their range of applicability. Blocking of these processes is very important and the book shows how to deal with this problem in an effective way and not only compute the performance measures of throughput, cycle times, and WIP but also to optimize the resources within these systems. The book is aimed at advanced undergraduate, graduate, and professionals and academics interested in network design, queueing performance models and their optimization. It assumes that the audience is fairly sophisticated in their mathematical understanding, although the explanations of the topics within the book are fairly detailed.

ISBN: 9783319788227

Standard No.: 10.1007/978-3-319-78822-7doiSubjects--Topical Terms:

527886
Mathematical models.

LC Class. No.: TA342-343

Dewey Class. No.: 003.3

Introduction to Queueing Networks = Theory ∩ Practice /
LDR:02811nam a22004215i 4500 001 989406
003 DE-He213
005 20200705222224.0
007 cr nn 008mamaa
008 201225s2018 gw | s |||| 0|eng d
020 $a 9783319788227 $9 978-3-319-78822-7
024 7 $a 10.1007/978-3-319-78822-7 $2 doi
035 $a 978-3-319-78822-7
050 4 $a TA342-343
072 7 $a PBWH $2 bicssc
072 7 $a MAT003000 $2 bisacsh
072 7 $a PBWH $2 thema
072 7 $a TBJ $2 thema
082 0 4 $a 003.3 $2 23
100 1 $a Smith, J. MacGregor. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1076280
245 1 0 $a Introduction to Queueing Networks $h [electronic resource] : $b Theory ∩ Practice / $c by J. MacGregor Smith.
250 $a 1st ed. 2018.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a XXV, 562 p. 366 illus., 246 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Springer Series in Operations Research and Financial Engineering, $x 1431-8598
505 0 $a Introduction G(V,E) -- Problem Overview Ω(G(V,E)) -- Mathematical Models and Properties of Queues G(V) -- Transportation and Loss Queues G(E) -- Open Queueing Network Algorithms f(G(V,E)) -- Closed Queueing Network Performance Models f(G(V,E,N)) -- Optimal Resource Allocation Problems (ORAP) G(V*) in TND -- Optimal Routing Problems (ORTE) G(E*) in TND -- Optimal Topology Problems (OTOP) G(V,E)* in TND -- Final Coda.
520 $a The book examines the performance and optimization of systems where queueing and congestion are important constructs. Both finite and infinite queueing systems are examined. Many examples and case studies are utilized to indicate the breadth and depth of the queueing systems and their range of applicability. Blocking of these processes is very important and the book shows how to deal with this problem in an effective way and not only compute the performance measures of throughput, cycle times, and WIP but also to optimize the resources within these systems. The book is aimed at advanced undergraduate, graduate, and professionals and academics interested in network design, queueing performance models and their optimization. It assumes that the audience is fairly sophisticated in their mathematical understanding, although the explanations of the topics within the book are fairly detailed.
650 0 $a Mathematical models. $3 527886
650 0 $a Computer simulation. $3 560190
650 0 $a Transportation engineering. $3 633205
650 0 $a Traffic engineering. $3 639529
650 1 4 $a Mathematical Modeling and Industrial Mathematics. $3 669172
650 2 4 $a Simulation and Modeling. $3 669249
650 2 4 $a Transportation Technology and Traffic Engineering. $3 1069531
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319788210
776 0 8 $i Printed edition: $z 9783319788234
776 0 8 $i Printed edition: $z 9783030076559
830 0 $a Springer Series in Operations Research and Financial Engineering, $x 1431-8598 $3 1267183
856 4 0 $u https://doi.org/10.1007/978-3-319-78822-7
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)