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-SSY163zbMath1356.60156OpenAlexW2231189794MaRDI QIDQ2956540

No author found.

Publication date: 18 January 2017

Full work available at URL: https://projecteuclid.org/euclid.ssy/1479287405

zbMATH Keywords

heavy trafficstochastic networksstate space collapseresource poolingdynamic controlthreshold policiesBrownian control problemsparallel server systems

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Brownian motion (60J65) Stochastic scheduling theory in operations research (90B36) Optimal stochastic control (93E20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of Brownian motions and diffusion theory (population genetics, absorption problems, etc.) (60J70) Existence of optimal solutions to problems involving randomness (49J55)

Related Items (4)

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 ⋮ 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