Brownian Networks with Discretionary Routing
DOI10.1287/OPRE.39.2.322zbMATH Open0729.60086OpenAlexW2032895205MaRDI QIDQ3353929FDOQ3353929
Authors: Lawrence M. Wein 
Publication date: 1991
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.39.2.322
Recommendations
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
- Optimal Control of a Two-Station Brownian Network
- scientific article; zbMATH DE number 4076265
- Dynamic scheduling for queueing networks derived from discrete-review policies
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Network with Controllable Inputs
Deterministic network models in operations research (90B10) Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Cited In (10)
- A broader view of Brownian networks
- Brownian models of open processing networks: Canonical representation of workload.
- DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM
- Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
- Correction: Brownian models of open processing networks: canonical representation of workload
- Optimal Control of a Two-Station Brownian Network
- Dynamic volunteer staffing in multicrop gleaning operations
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
- Dynamic scheduling in manufacturing systems using Brownian approximations
- Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies
This page was built for publication: Brownian Networks with Discretionary Routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3353929)
