Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
From MaRDI portal
Publication:1371003
Recommendations
Cites work
- scientific article; zbMATH DE number 3868389 (Why is no real title available?)
- scientific article; zbMATH DE number 4056741 (Why is no real title available?)
- scientific article; zbMATH DE number 4076265 (Why is no real title available?)
- scientific article; zbMATH DE number 3514781 (Why is no real title available?)
- scientific article; zbMATH DE number 932423 (Why is no real title available?)
- Brownian Networks with Discretionary Routing
- Dynamic Scheduling of a Four-Station Queueing Network
- Dynamic Scheduling of a Multiclass Make-to-Stock Queue
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
- Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
- Open Queueing Networks in Heavy Traffic
- Resource pooling in queueing networks with dynamic routing
- Routing and Singular Control for Queueing Networks in Heavy Traffic
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Closed Network
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Network with Controllable Inputs
- Scheduling networks of queues: Heavy traffic analysis of a simple open network
Cited in
(41)- MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
- Dynamic scheduling in manufacturing systems using Brownian approximations
- Two workload properties for Brownian networks
- Workload reduction of a generalized Brownian network
- Singular control with state constraints on unbounded domain
- Near optimal control of queueing networks over a finite time horizon
- Brownian models of open processing networks: Canonical representation of workload.
- Fluid models of parallel service systems under FCFS
- On the control of fork-join networks
- A phase transition behavior for Brownian motions interacting through their ranks
- One-dimensional Brownian particle systems with rank-dependent drifts
- Pathwise optimality of the exponential scheduling rule for wireless channels
- Controlled stochastic networks in heavy traffic: convergence of value functions
- Heavy traffic analysis of maximum pressure policies for stochastic processing networks with multiple bottlenecks
- Brownian control problems for a multiclass M/M/1 queueing problem with model uncertainty
- Diffusion limit for the partner model at the critical value
- Control Policies Approaching Hierarchical Greedy Ideal Performance in Heavy Traffic for Resource Sharing Networks
- Scheduling a multi class queue with many exponential servers: asymptotic optimality in heavy traffic.
- A fluid approach to large volume job shop scheduling
- An asymptotic optimality result for the multiclass queue with finite buffers in heavy traffic
- Diffusion approximations for controlled stochastic networks: an asymptotic bound for the value function
- Existence of optimal controls for singular control problems with state constraints
- Control of the multiclass \(\mathrm{G}/\mathrm{G}/1\) queue in the moderate deviation regime
- The Effect of Increasing Routing Choice on Resource Pooling
- Asymptotic optimality of the binomial-exhaustive policy for polling systems with large switchover times
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- Two-server closed networks in heavy traffic: diffusion limits and asymptotic optimality.
- A broader view of Brownian networks
- Correction: Brownian models of open processing networks: canonical representation of workload
- On the asymptotic optimality of the \(c\mu\)-rule in queueing networks
- A large deviations approach to asymptotically optimal control of crisscross network in heavy traffic
- Asymptotic optimality of maximum pressure policies in stochastic processing networks
- Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
- Dynamic scheduling of a \(GI/GI/1+GI\) queue with multiple customer classes
- On the dynamic control of matching queues
- Resource sharing networks: overview and an open problem
- On singular control problems, the time-stretching method, and the weak-M1 topology
- Parallel server systems under an extended heavy traffic condition: a lower bound
- Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies
- Ergodic control of resource sharing networks: lower bound on asymptotic costs
- Singular control of (reflected) Brownian motion: a computational method suitable for queueing applications
This page was built for publication: Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1371003)
