Sequencing and Routing in Multiclass Queueing Networks Part II: Workload Relaxations

DOI10.1137/S036301290138376XzbMath1061.90047MaRDI QIDQ4442979

Sean P. Meyn

Publication date: 8 January 2004

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

zbMATH Keywords

optimal controlschedulingqueueing networksrouting

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Optimal stochastic control (93E20) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (19)

Fluid analysis of an input control problem ⋮ Near optimal control of queueing networks over a finite time horizon ⋮ Optimal stopping and free boundary characterizations for some Brownian control problems ⋮ Approximate linear programming for networks: average cost bounds ⋮ 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 ⋮ Controlled stochastic networks in heavy traffic: convergence of value functions ⋮ Joint routing and scheduling control in a two-class network with a flexible server ⋮ Fluid limits of optimally controlled queueing networks ⋮ A differential game formulation of a controlled network ⋮ Coding and control for communication networks ⋮ Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies ⋮ Reliability by design in distributed power transmission networks ⋮ Diffusion approximations for controlled stochastic networks: an asymptotic bound for the value function ⋮ Heavy Traffic Analysis of a Simple Closed-Loop Supply Chain ⋮ On the Control of Fork-Join Networks ⋮ Optimal control of a flexible server ⋮ A large deviations approach to asymptotically optimal control of crisscross network in heavy traffic ⋮ Dynamic safety-stocks for asymptotic optimality in stochastic networks

This page was built for publication: Sequencing and Routing in Multiclass Queueing Networks Part II: Workload Relaxations