Scheduling networks of queues: Heavy traffic analysis of a simple open network

DOI10.1007/BF01225319zbMath0684.90034OpenAlexW1978016577MaRDI QIDQ1825745

Lawrence M. Wein, J. Michael Harrison

Publication date: 1989

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01225319

zbMATH Keywords

queueing networkdynamic prioritydynamic controltwo types of customerspathwise solutionheavy traffic analysisBrownian approximationsdynamic sequencing policylong-run average expected number of customerstwo single-server stations

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (26)

Two-server closed networks in heavy traffic: diffusion limits and asymptotic optimality. ⋮ Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy ⋮ Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality. ⋮ Control and scheduling in a two-station queueing network: Optimal policies and heuristics ⋮ Asymptotic optimality of maximum pressure policies in stochastic processing networks ⋮ Optimal stopping and free boundary characterizations for some Brownian control problems ⋮ Scheduling in a multi-class series of queues with deterministic service times ⋮ Workload minimization in re-entrant lines ⋮ On the asymptotic optimality of the \(c\mu\)-rule in queueing networks ⋮ Correction: Brownian models of open processing networks: canonical representation of workload ⋮ On scheduling a multiclass queue with abandonments under general delay costs ⋮ Dynamic control of Brownian networks: State space collapse and equivalent workload formulations ⋮ The archievable region method in the optimal control of queueing systems; formulations, bounds and policies ⋮ Performance evaluation of scheduling control of queueing networks: Fluid model heuristics ⋮ Optimal buffer size and dynamic rate control for a queueing system with impatient customers in heavy traffic ⋮ Non-product form equilibrium probabilities in a class of two-station closed reentrant queueing networks ⋮ Dynamic Volunteer Staffing in Multicrop Gleaning Operations ⋮ A review of open queueing network models of manufacturing systems ⋮ Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies ⋮ Dynamic scheduling in manufacturing systems using Brownian approximations ⋮ Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling ⋮ Scheduling networks of queues: Heavy traffic analysis of a simple open network ⋮ Brownian models of open processing networks: Canonical representation of workload. ⋮ Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies ⋮ A large deviations approach to asymptotically optimal control of crisscross network in heavy traffic ⋮ Inventory Management with Stochastic Lead Times

Cites Work

• Unnamed Item
• Scheduling networks of queues: Heavy traffic analysis of a simple open network
• Dynamic Scheduling of a Four-Station Queueing Network
• Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Network with Controllable Inputs

This page was built for publication: Scheduling networks of queues: Heavy traffic analysis of a simple open network