Skip to main content Accessibility help
×
  1. Home
  2. Browse subjects
  3. Statistics and Probability
  4. Applied probability and stochastic networks
  5. Content listing

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

980 results in Applied probability and stochastic networks

Page 13 of 49

  • 14 - Optimal Control of Transient Networks

  • from Part IV - Fluid Models of Multi-Class Queueing
  • Gideon Weiss, University of Haifa, Israel
  • Book:
    Scheduling and Control of Queueing Networks
    Published online:
    01 October 2021
    Print publication:
    14 October 2021, pp 236-256

  • Summary

    We continue the discussion of control of transient MCQN. We formulate a fluid optimization problem that we can solve using a separated continuous linear programming (SCLP) algorithm.We then describe a method of tracking the optimal fluid solution, using virtual infinite queues and maximum pressure policy. We show that this procedure is asymptotically optimal for high-volume systems, as exemplified by semiconductor wafer fabs.

  • 6 - Scaling of G/G/1 and G/G/∞

  • from Part II - Approximations of the Single Queue
  • Gideon Weiss, University of Haifa, Israel
  • Book:
    Scheduling and Control of Queueing Networks
    Published online:
    01 October 2021
    Print publication:
    14 October 2021, pp 83-101

  • Summary

    We discuss fluid and diffusion approximations to the GI/GI/1 queue by scaling time and space. We also introduce the GI/GI/1 queueing system and study it under many-server scaling. The three types of scaling, fluid, diffusion, and many-server, form the backbone for Parts IV, V, andVI of the book, where we use them to study networks of queues. These approximations allow us to obtain a much better idea of how queues evolve over time than can be obtained from an exact discrete state Markov description.

Scheduling and Control of Queueing Networks
  • Gideon Weiss
  • Published online:
    01 October 2021
    Print publication:
    14 October 2021
  • 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.

Page 13 of 49