Queues: A Course in Queueing Theory (International Series in Operations Research & Management Science, 191),Used

Queues: A Course in Queueing Theory (International Series in Operations Research & Management Science, 191),Used

Out of Stock
SKU: SONG1461467640
Brand: Springer
$144.63
Sold out
Quantity
Add to wishlist
Add to compare

Processing time: 1-3 days

US Orders Ships in: 3-5 days

International Orders Ships in: 8-12 days

Return Policy: 15-days return on defective items

Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

Queueing theory (the mathematical theory of waiting lines in all its configurations) continues to be a standard major area of operations research on the stochastic side. Therefore, universities with an active program in operations research sometimes will have an entire course devoted mainly or entirely to queueing theory, and the course is also taught in computer science, electrical engineering, mathematics, and industrial engineering programs.The basic course in queueing theory is often taught at first year graduate level, though can be taught at senior level undergraduate as well. This text evolved from the authors preferred syllabus for teaching the course, presenting the material in a more logical order than other texts and so being more effective in teaching the basics of queueing theory.The first three chapters focus on the needed preliminaries, including exposition distributions, Poisson processes and generating functions, renewal theory, and Markov chains, Then, rather than switching to firstcome firstserved memoryless queues here as most texts do, Haviv discusses the M/G/1 model instead of the M/M/1, and then covers priority queues. Later chapters cover the G/M/1 model, thirteen examples of continuoustime Markov processes, open networks of memoryless queues and closed networks, queueing regimes with insensitive parameters, and then concludes with twodimensional queueing models which are quasi birth and death processes. Each chapter ends with exercises.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed