On the improvement from scheduling a two-station queueing network in heavy traffic

DOI10.1016/0167-6377(92)90029-3zbMath0755.60075OpenAlexW2053776381MaRDI QIDQ1197909

Lawrence M. Wein, Jihong Ou

Publication date: 16 January 1993

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/5107

zbMATH Keywords

Brownian approximationsqueueing network in heavy traffictwo-station queueing network scheduling problem in heavy traffic

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal and Approximately Optimal Control Policies for Queues in Heavy Traffic
• Optimal Control of a Two-Station Brownian Network
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Limit theorems for pathwise average cost per unit time problems for controlled queues in heavy traffic
• Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Network with Controllable Inputs
• Routing and Singular Control for Queueing Networks in Heavy Traffic

This page was built for publication: On the improvement from scheduling a two-station queueing network in heavy traffic