On the Control of Fork-Join Networks
From MaRDI portal
Publication:5219729
DOI10.1287/MOOR.2018.0935zbMath1434.60265arXiv1505.04470OpenAlexW2962836550MaRDI QIDQ5219729
Publication date: 12 March 2020
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.04470
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36)
Related Items (4)
Heavy-traffic limits for an infinite-server fork-join queueing system with dependent and disruptive services ⋮ On the asymptotic optimality of the \(c\mu\)-rule in queueing networks ⋮ On the Optimal Control of Parallel Processing Networks with Resource Collaboration and Multitasking ⋮ Control of Fork-Join Processing Networks with Multiple Job Types and Parallel Shared Resources
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Correction: Brownian models of open processing networks: canonical representation of workload
- Stochastic discrete flow networks: Diffusion approximations and bottlenecks
- Manufacturing flow line systems: A review of models and analytical results
- Processing networks with parallel and sequential tasks: Heavy traffic analysis and Brownian limits
- An invariance principle for semimartingale reflecting Brownian motions in an orthant
- Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
- The trouble with diversity: Fork-join networks with heterogeneous customer population
- Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
- Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies
- Continuous-review tracking policies for dynamic control of stochastic networks
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- Heavy traffic resource pooling in parallel-server systems
- Heavy-traffic limits for an infinite-server fork-join queueing system with dependent and disruptive services
- Asymptotic optimality of maximum pressure policies in stochastic processing networks
- Stochastic-Process Limits
- Gaussian Limits for a Fork-Join Network with Nonexchangeable Synchronization in Heavy Traffic
- Some Useful Functions for Functional Limit Theorems
- Sequencing and Routing in Multiclass Queueing Networks Part II: Workload Relaxations
- From Project to Process Management: An Empirically-Based Framework for Analyzing Product Development Time
- Dynamic Scheduling of a Two-Server Parallel Server System with Complete Resource Pooling and Reneging in Heavy Traffic: Asymptotic Optimality of a Two-Threshold Policy
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
This page was built for publication: On the Control of Fork-Join Networks
