Dynamic Scheduling of a Four-Station Queueing Network

DOI10.1017/S0269964800001492zbMath1134.90408MaRDI QIDQ3415963

G. M. Louth, C. N. Laws

Publication date: 19 January 2007

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36)

Related Items (14)

Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy ⋮ Scheduling in a multi-class series of queues with deterministic service times ⋮ Correction: Brownian models of open processing networks: canonical representation of workload ⋮ Dynamic control of Brownian networks: State space collapse and equivalent workload formulations ⋮ Fluid Models of Parallel Service Systems Under FCFS ⋮ Switched networks with maximum weight policies: fluid approximation and multiplicative state space collapse ⋮ A review of open queueing network models of manufacturing systems ⋮ Coding and control for communication networks ⋮ 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 ⋮ Heavy traffic analysis of maximum pressure policies for stochastic processing networks with multiple bottlenecks ⋮ Scheduling networks of queues: Heavy traffic analysis of a simple open network ⋮ Brownian models of open processing networks: Canonical representation of workload. ⋮ Dynamic safety-stocks for asymptotic optimality in stochastic networks

Cites Work

• Extremal Splittings of Point Processes
• The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks
• A simple dynamic routing problem
• Optimality of the shortest line discipline
• A Minimum Delay Routing Algorithm Using Distributed Computation
• On the optimal assignment of customers to parallel servers
• A Basic Dynamic Routing Problem and Diffusion
• Weak convergence theorems for priority queues: preemptive-resume discipline

This page was built for publication: Dynamic Scheduling of a Four-Station Queueing Network