Dynamic Scheduling of a Four-Station Queueing Network
From MaRDI portal
Recommendations
- 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 simple open network
- Random Yield, Rework and Scrap in a Multistage Batch Manufacturing Environment
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Network with Controllable Inputs
Cites work
- A Basic Dynamic Routing Problem and Diffusion
- A Minimum Delay Routing Algorithm Using Distributed Computation
- A simple dynamic routing problem
- Extremal Splittings of Point Processes
- On the optimal assignment of customers to parallel servers
- Optimality of the shortest line discipline
- The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks
- Weak convergence theorems for priority queues: preemptive-resume discipline
Cited in
(27)- Heavy traffic analysis of maximum pressure policies for stochastic processing networks with multiple bottlenecks
- A review of open queueing network models of manufacturing systems
- Dynamic scheduling in multiclass queueing networks: Stability under discrete-review policies
- Scheduling in a multi-class series of queues with deterministic service times
- Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
- Brownian models of open processing networks: Canonical representation of workload.
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
- A survey of Markov decision models for control of networks of queues
- Scheduling networks of queues: Heavy traffic analysis of a simple open network
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- Performance evaluation of scheduling control of queueing networks: Fluid model heuristics
- Coding and control for communication networks
- Switched networks with maximum weight policies: fluid approximation and multiplicative state space collapse
- Dynamic safety-stocks for asymptotic optimality in stochastic networks
- Modeling and dynamic scheduling of a queueing system with blocking and starvation
- Optimal Control of a Two-Station Brownian Network
- Comparison of dispatch policies for a single server queueing model with limited operational control
- Dynamic Scheduling for a Flexible Processing Network
- Resource pooling in queueing networks with dynamic routing
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Closed Network
- Dynamic Scheduling of a Multiclass Fluid Network
- Dynamic Scheduling of a Production/Inventory System with By-Products and Random Yield
- Fluid models of parallel service systems under FCFS
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network
- Integrating queueing theory and scheduling for dynamic scheduling problems
- Dynamic scheduling in manufacturing systems using Brownian approximations
- Correction: Brownian models of open processing networks: canonical representation of workload
This page was built for publication: Dynamic Scheduling of a Four-Station Queueing Network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3415963)
