Author: Lawrence M. WeinPublisher:
ISBN:
Category :
Languages : en
Pages : 68
Book Description
Scheduling a Two-station Multiclass Queueing Network in Heavy Traffic
Author: Lawrence M. WeinScheduling a Two-Station Multiclass Queueing Network in Heavy Traffic (Classic Reprint)
Author: Lawrence M. WeinPublisher: Forgotten Books
ISBN: 9780365647829
Category : Business & Economics
Languages : en
Pages : 78
Book Description
Excerpt from Scheduling a Two-Station Multiclass Queueing Network in Heavy Traffic The queueing network model can also accomodate machine breakdown and repair. By assuming that the amount of machine busy time between consecutive breakdowns is exponentially distributed, the breakdown and repair can be incorporated into the service time distributions for each customer class; see Harrison [4] for details. The modified rm and sf, are interpreted as the mean and variance of the effective service time of a class k. About the Publisher Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Asymptotically Optimal Scheduling of a Two-station Multiclass Queueing Network
Author: Lawrence Michael WeinPublisher:
ISBN:
Category :
Languages : en
Pages : 154
Book Description
Scheduling and Control of Queueing Networks
Author: Gideon WeissPublisher: Cambridge University Press
ISBN: 1108245773
Category : Mathematics
Languages : en
Pages : 448
Book Description
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.
Heavy Traffic Analysis of Controlled Queueing and Communication Networks
Author: Harold KushnerPublisher: Springer Science & Business Media
ISBN: 1461300053
Category : Mathematics
Languages : en
Pages : 522
Book Description
One of the first books in the timely and important area of heavy traffic analysis of controlled and uncontrolled stochastics networks, by one of the leading authors in the field. The general theory is developed, with possibly state dependent parameters, and specialized to many different cases of practical interest.
Scheduling Network of Queues
Author: Lawrence M. WeinPublisher: Forgotten Books
ISBN: 9780484134019
Category : Mathematics
Languages : en
Pages : 60
Book Description
Excerpt from Scheduling Network of Queues: Heavy Traffic Analysis of a Multistation Network With Controllable Inputs Motivated by a factory scheduling problem, we consider the problem of input control (subject to a specified input mix) and priority sequencing in a multistation, multiclass queueing network with general service time distributions and a general routing structure. The objective is to minimize the long - run expected average number of customers in the system subject to a constraint on the long - run expected average output rate. Under balanced heavy loading conditions, this scheduling problem can be approximated by a control problem involving Brownian motion. Linear programming is used to reduce the workload formulation of this control problem to a constrained singular control problem for a multidimensional Brownian motion. The finite difference approximation method is then used to find a linear programming solution to the latter problem. The solution is interpreted in terms of the original queueing system in order to obtain an effective scheduling policy. The priority sequencing policy is based on dynamic reduced costs from a linear program, and the workload regulating input policy releases a customer into the system whenever the workload process enters a particular region. An example is provided that illustrates the procedure and demonstrates its effectiveness. About the Publisher Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Scheduling Multiclass Queueing Networks on Parallel Servers
Author: Kevin D. GlazebrookOn the Convergence of Multiclass Queueing Networks in Heavy Traffic (Classic Reprint)
Author: J. G. DaiPublisher: Forgotten Books
ISBN: 9780656484010
Category : Mathematics
Languages : en
Pages : 26
Book Description
Excerpt from On the Convergence of Multiclass Queueing Networks in Heavy Traffic In his pioneering paper on queueing networks, Jackson [22] assumed that customers visiting or occupying any given station are essentially indistinguishable from one another, and that a customer completing service at station i will move next to station j with some fixed probability n, independent of all previous history. Thus in Jackson's networks, each station serves a single customer class, hence these networks have been called single-class networks. Jackson's model was extended by Baskett ci al. [1] and Kelly [24] to networks populated by multiple types of customers, each type following a deterministic route. The routing mechanism described in this paper subsumes those considered in [1, Readers are referred to Harrison [14] and Harrison and Nguyen [15, 16] for further discussion. About the Publisher Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Scheduling Multiclass Queueing Networks on Parallel Servers:approximate and Heavy-traffic Optimality of Klimov's Rule
Author: Kevin D. GlazebrookAnalysis of Communication Networks: Call Centres, Traffic and Performance
Author: David R. McDonaldPublisher: American Mathematical Soc.
ISBN: 0821819917
Category : Mathematics
Languages : en
Pages : 210
Book Description
This volume consists of the proceedings of the Workshop on Analysis and Simulation of Communication Networks held at The Fields Institute (Toronto). The workshop was divided into two main themes, entitled "Stability and Load Balancing of a Network of Call Centres" and "Traffic and Performance". The call centre industry is large and fast-growing. In order to provide top-notch customer service, it needs good mathematical models. The first part of the volume focuses on probabilistic issues involved in optimizing the performance of a call centre. While this was the motivating application, many of the papers are also applicable to more general distributed queueing networks. The second part of the volume discusses the characterization of traffic streams and how to estimate their impact on the performance of a queueing system. The performance of queues under worst-case traffic flows or flows with long bursts is treated. These studies are motivated by questions about buffer dimensioning and call admission control in ATM or IP networks. This volume will serve researchers as a comprehensive, state-of-the-art reference source on developments in this rapidly expanding field.