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
DOI10.1214/14-SSY163zbMATH Open1356.60156OpenAlexW2231189794MaRDI QIDQ2956540FDOQ2956540
Authors:
Publication date: 18 January 2017
Full work available at URL: https://projecteuclid.org/euclid.ssy/1479287405
Recommendations
- Optimal control of parallel server systems with many servers in heavy traffic
- Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: asymptotic optimality of a threshold policy
- Scheduling control for queueing systems with many servers: asymptotic optimality in heavy traffic
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- Dynamic control of \(N\)-systems with many servers: asymptotic optimality of a static priority policy in heavy traffic
- Scheduling parallel servers in the nondegenerate slowdown diffusion regime: asymptotic optimality results
- 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
- Dynamic load balancing in parallel queueing systems: stability and optimal control
- Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
stochastic networksheavy trafficresource poolingdynamic controlthreshold policiesstate space collapseBrownian control problemsparallel server systems
Applications of Brownian motions and diffusion theory (population genetics, absorption problems, etc.) (60J70) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Brownian motion (60J65) Existence of optimal solutions to problems involving randomness (49J55) Optimal stochastic control (93E20) Stochastic scheduling theory in operations research (90B36)
Cited In (5)
- 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
- On the asymptotic optimality of the \(c\mu\)-rule in queueing networks
- Heavy traffic analysis of multi-class bipartite queueing systems under FCFS
- Parallel server systems under an extended heavy traffic condition: a lower bound
This page was built for publication: 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2956540)
