Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Closed Network
Name
OR-219-90.pdf
Size
1.91 MB
Format
Adobe PDF
Checksum (MD5)
ab4f0ada13d3af1cbca4f8f6081de2ad
Author(s)
Chevalier, Philippe B.
Wein, Lawrence M.
Date Issued
July 1990
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 219-90
Abstract
We consider the problem of finding an optimal dynamic priority sequencing policy to maximize the mean throughput rate in a multistation, multiclass closed queueing network with general service time distributions and a general routing structure. Under balanced heavy loading conditions, this scheduling problem can be approximated by a control problem involving Brownian motion. Although a unique, closed form solution to the Brownian control problem is not derived, an analysis of the problem leads to an effective static sequencing policy, and to an approximate means of comparing the relative performance of arbitrary static policies. Three examples are given that illustrate the effectiveness of our procedure.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
