Control of fork-join processing networks with multiple job types and parallel shared resources
From MaRDI portal
Publication:5085142
DOI10.1287/MOOR.2021.1170zbMATH Open1495.60083arXiv2002.01496OpenAlexW3210203763MaRDI QIDQ5085142FDOQ5085142
Authors: Erhun Özkan 
Publication date: 27 June 2022
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Abstract: A fork-join processing network is a queueing network in which tasks associated with a job can be processed simultaneously. Fork-join processing networks are prevalent in computer systems, healthcare, manufacturing, project management, justice system, etc. Unlike the conventional queueing networks, fork-join processing networks have synchronization constraints that arise due to the parallel processing of tasks and can cause significant job delays. We study scheduling control in fork-join processing networks with multiple job types and parallel shared resources. Jobs arriving in the system fork into arbitrary number of tasks, then those tasks are processed in parallel, and then they join and leave the network. There are shared resources processing multiple job types. We study the scheduling problem for those shared resources (that is, which type of job to prioritize at any given time) and propose an asymptotically optimal scheduling policy in diffusion scale.
Full work available at URL: https://arxiv.org/abs/2002.01496
Recommendations
- On the control of fork-join networks
- On the optimal control of parallel processing networks with resource collaboration and multitasking
- Generalized parallel-server fork-join queues with dynamic task scheduling
- Heavy-traffic limits for a fork-join networkin the Halfin-Whitt regime
- Acyclic fork-join queuing networks
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Functional limit theorems; invariance principles (60F17) Optimal stochastic control (93E20) Stochastic scheduling theory in operations research (90B36)
Cites Work
- Title not available (Why is that?)
- Stochastic-Process Limits
- Title not available (Why is that?)
- Title not available (Why is that?)
- MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
- Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
- From Project to Process Management: An Empirically-Based Framework for Analyzing Product Development Time
- Manufacturing flow line systems: A review of models and analytical results
- Gaussian limits for a fork-join network with nonexchangeable synchronization in heavy traffic
- Title not available (Why is that?)
- Sequencing and Routing in Multiclass Queueing Networks Part II: Workload Relaxations
- An invariance principle for semimartingale reflecting Brownian motions in an orthant
- Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- Title not available (Why is that?)
- Asymptotic optimality of maximum pressure policies in stochastic processing networks
- Brownian models of open processing networks: Canonical representation of workload.
- A unified numerical scheme for linear-quadratic optimal control problems with joint control and state constraints
- Asymptotically Optimal Inventory Control for Assemble-to-Order Systems with Identical Lead Times
- Heavy-traffic limits for an infinite-server fork-join queueing system with dependent and disruptive services
- Processing networks with parallel and sequential tasks: Heavy traffic analysis and Brownian limits
- The trouble with diversity: Fork-join networks with heterogeneous customer population
- Continuous-review tracking policies for dynamic control of stochastic networks
- Title not available (Why is that?)
- Robust scheduling for flexible processing networks
- 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
- On the Control of Fork-Join Networks
- Throughput Scalability Analysis of Fork-Join Queueing Networks
Cited In (1)
This page was built for publication: Control of fork-join processing networks with multiple job types and parallel shared resources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085142)
