Scheduling networks of queues: Heavy traffic analysis of a multistation closed network

Scheduling networks of queues: Heavy traffic analysis of a multistation closed network

0.00 Avg rating0 Votes
Article ID: iaor19941435
Country: United States
Volume: 41
Issue: 4
Start Page Number: 743
End Page Number: 758
Publication Date: Jul 1993
Journal: Operations Research
Authors: ,
Keywords: scheduling, networks: scheduling
Abstract:

The authors 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. Several examples are provided that illustrate the effectiveness of the present procedure.

Reviews

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