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

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

0.00 Avg rating0 Votes
Article ID: iaor1993807
Country: Netherlands
Volume: 11
Issue: 4
Start Page Number: 225
End Page Number: 232
Publication Date: May 1992
Journal: Operations Research Letters
Authors: ,
Keywords: scheduling
Abstract:

For a two-station multiclass queueing network in heavy traffic, the authors 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) of a Brownian control problem that approximates (via Harrison’s 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.

Reviews

Required fields are marked *. Your email address will not be published.