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

Authors:
Jihong Ou;Lawrence M Wein
Affiliations:
Operations Research Center, M.I.T., Cambridge, MA, USA;Sloan School of Management, M.I.T., Cambridge, MA, USA
Venue:
Operations Research Letters
Year:
1992

Citing 5
Cited 0

Optimal and approximately optimal control policies for queues in heavy traffic

SIAM Journal on Control and Optimization
Optimal control of a two-station Brownian network

Mathematics of Operations Research
Routing and singular control for queueing networks in heavy traffic

SIAM Journal on Control and Optimization
Scheduling networks of queues: heavy traffic analysis of a two-station network with controllable inputs

Operations Research
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

For a two-station multiclass queueing network in heavy traffic, we assess the improvement from scheduling (job release and priority sequencing) that can occur relative to Poisson input and first-come first-served (FCFS) sequencing. In particular, simple upper bounds are derived on the optimal objective function value (found in Wein [7]) of a Brownian control problem that approximates (via Harrison's [2] model) a two-station queueing network scheduling problem in heavy traffic. When the system is perfectly balanced, the Brownian analysis predicts that optimal scheduling will reduce the long run expected average number of customers in the network by at least a factor of four relative to the Poisson input, FCFS sequencing policy that achieves the same throughput rate. When the system is not perfectly balanced, the corresponding factor is slightly smaller than two.