Scheduling and Control of Queueing Networks
Gideon Weiss
- 出版商: Cambridge
- 出版日期: 2021-10-14
- 售價: $5,220
- 貴賓價: 9.5 折 $4,959
- 語言: 英文
- 頁數: 200
- 裝訂: Hardcover - also called cloth, retail trade, or trade
- ISBN: 1108415326
- ISBN-13: 9781108415323
-
其他版本:
Scheduling and Control of Queueing Networks (Paper)
海外代購書籍(需單獨結帳)
買這商品的人也買了...
-
$500$490 -
$356零起步玩轉 Mind + 創客教程 — 基於 micro:bit 開發板
-
$880$695 -
$834$792 -
$680$537
相關主題
商品描述
Applications of queueing network models have multiplied in the last generation, including scheduling of large manufacturing systems, control of patient flow in health systems, load balancing in cloud computing, and matching in ride sharing. These problems are too large and complex for exact solution, but their scale allows approximation. This book is the first comprehensive treatment of fluid scaling, diffusion scaling, and many-server scaling in a single text presented at a level suitable for graduate students. Fluid scaling is used to verify stability, in particular treating max weight policies, and to study optimal control of transient queueing networks. Diffusion scaling is used to control systems in balanced heavy traffic, by solving for optimal scheduling, admission control, and routing in Brownian networks. Many-server scaling is studied in the quality and efficiency driven Halfin–Whitt regime and applied to load balancing in the supermarket model and to bipartite matching in ride-sharing applications.
作者簡介
Gideon Weiss is Professor Emeritus in the Department of Statistics at the University of Haifa, Israel. He has previously held tenured positions at Tel Aviv University and at Georgia Tech Industrial and Systems Engineering and visiting positions at Berkeley, MIT, Stanford, NYU, and NUS. He is author of some 90 research papers and served on the editorial boards of leading journals on operations research and applied probability. His work includes significant contributions to the fields of time series, stochastic scheduling, bandit problems, fluid analysis of queueing networks, continuous linear programming, and matching problems.