Correction: Brownian models of open processing networks: canonical representation of workload
From MaRDI portal
Publication:862225
DOI10.1214/105051606000000583zbMath1121.60095arXivmath/0610352OpenAlexW2100324612MaRDI QIDQ862225
Publication date: 5 February 2007
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0610352
Queueing theory (aspects of probability theory) (60K25) Deterministic network models in operations research (90B10) Applications of Brownian motions and diffusion theory (population genetics, absorption problems, etc.) (60J70)
Related Items
Unnamed Item ⋮ Information and Memory in Dynamic Resource Allocation ⋮ On the Control of Fork-Join Networks
Cites Work
- Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
- Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
- Scheduling networks of queues: Heavy traffic analysis of a simple open network
- Performance evaluation of scheduling control of queueing networks: Fluid model heuristics
- Brownian Networks with Discretionary Routing
- Dynamic Scheduling of a Four-Station Queueing Network
- Resource pooling in queueing networks with dynamic routing
- Random Yield, Rework and Scrap in a Multistage Batch Manufacturing Environment
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Closed Network
- Dynamic Scheduling of a Multiclass Fluid Network
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Network with Controllable Inputs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
