Control of fork-join processing networks with multiple job types and parallel shared resources
From MaRDI portal
Publication:5085142
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.
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
Cites work
- scientific article; zbMATH DE number 1631026 (Why is no real title available?)
- scientific article; zbMATH DE number 4076265 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 1354815 (Why is no real title available?)
- A unified numerical scheme for linear-quadratic optimal control problems with joint control and state constraints
- An invariance principle for semimartingale reflecting Brownian motions in an orthant
- Asymptotic optimality of maximum pressure policies in stochastic processing networks
- Asymptotically optimal inventory control for assemble-to-order systems with identical lead times
- Brownian models of open processing networks: Canonical representation of workload.
- Continuous-review tracking policies for dynamic control of stochastic 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
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- From Project to Process Management: An Empirically-Based Framework for Analyzing Product Development Time
- Gaussian limits for a fork-join network with nonexchangeable synchronization in heavy traffic
- Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
- Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies
- Heavy-traffic limits for a fork-join networkin the Halfin-Whitt regime
- Heavy-traffic limits for an infinite-server fork-join queueing system with dependent and disruptive services
- Manufacturing flow line systems: A review of models and analytical results
- MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
- On patient flow in hospitals: a data-based queueing-science perspective
- On the control of fork-join networks
- Processing networks with parallel and sequential tasks: Heavy traffic analysis and Brownian limits
- Robust scheduling for flexible processing networks
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
- Sequencing and Routing in Multiclass Queueing Networks Part II: Workload Relaxations
- Stochastic-Process Limits
- The trouble with diversity: Fork-join networks with heterogeneous customer population
- Throughput scalability analysis of fork-join queueing networks
Cited in
(4)
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)
