Control of Fork-Join Processing Networks with Multiple Job Types and Parallel Shared Resources
From MaRDI portal
Publication:5085142
DOI10.1287/MOOR.2021.1170zbMath1495.60083arXiv2002.01496OpenAlexW3210203763MaRDI QIDQ5085142
Publication date: 27 June 2022
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.01496
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36) Optimal stochastic control (93E20) Functional limit theorems; invariance principles (60F17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
- Brownian models of open processing networks: Canonical representation of workload.
- 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 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
- Dynamic scheduling for parallel server systems in heavy traffic: Graphical structure, decoupled workload matrix and some sufficient conditions for solvability of the Brownian control problem
- Asymptotically Optimal Inventory Control for Assemble-to-Order Systems with Identical Lead Times
- 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
- Throughput Scalability Analysis of Fork-Join Queueing Networks
- A unified numerical scheme for linear-quadratic optimal control problems with joint control and state constraints
- On the Control of Fork-Join Networks
- Robust scheduling for flexible processing networks
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
This page was built for publication: Control of Fork-Join Processing Networks with Multiple Job Types and Parallel Shared Resources