Scheduling Networks of Queues:  Heavy Traffic Analysis of a Multistation Closed Network

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5319

Full metadata record

DC Field	Value	Language
dc.creator	Chevalier, Philippe B.	-
dc.creator	Wein, Lawrence M.	-
dc.date	2004-05-28T19:33:29Z	-
dc.date	2004-05-28T19:33:29Z	-
dc.date	1990-07	-
dc.date.accessioned	2013-10-09T02:39:01Z	-
dc.date.available	2013-10-09T02:39:01Z	-
dc.date.issued	2013-10-09	-
dc.identifier	http://hdl.handle.net/1721.1/5319	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	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.	-
dc.format	2007841 bytes	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.publisher	Massachusetts Institute of Technology, Operations Research Center	-
dc.relation	Operations Research Center Working Paper;OR 219-90	-
dc.title	Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Closed Network	-
dc.type	Working Paper	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI