𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Introduction to Queuing Theory

✍ Scribed by B. V. Gnedenko, I. N. Kovalenko (auth.)


Publisher
BirkhΓ€user Basel
Year
1989
Tongue
English
Leaves
326
Series
Mathematical Modeling 5
Edition
2
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Table of Contents


Front Matter....Pages i-xi
Introduction to the Second Edition....Pages 1-1
Introduction to the First Edition....Pages 2-7
Problems of Queueing Theory under the Simplest Assumptions....Pages 8-68
The Study of the Incoming Customer Stream....Pages 69-135
Some Classes of Stochastic Processes....Pages 136-161
Semi-Markov Models of Queueing Systems....Pages 162-224
Application of More General Methods....Pages 225-273
Statistical Simulation of Systems....Pages 274-293
Back Matter....Pages 294-315

✦ Subjects


Computational Science and Engineering; Computational Mathematics and Numerical Analysis; Algorithms; Data Structures


πŸ“œ SIMILAR VOLUMES


Introduction to Queueing Theory
✍ Robert B Cooper πŸ“‚ Library πŸ“… 1981 πŸ› North Holland 🌐 English

This is a revised, expanded, and improved version of my textbook, Introduction to Queueing Theory. As before, it is written primarily for seniors and graduate students in operations research, computer science, and industrial engineering; and as before, the emphasis is on insight and understanding ra

Introduction to Queueing Networks: Theor
✍ J. MacGregor Smith πŸ“‚ Library πŸ“… 2018 πŸ› Springer International Publishing 🌐 English

<p><p>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

Introduction to queueing networks : theo
✍ Smith, J. MacGregor πŸ“‚ Library πŸ“… 2018 πŸ› Springer 🌐 English

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 appli