Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5107Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Ou, Jihong | - |
| dc.creator | Wein, Lawrence M. | - |
| dc.date | 2004-05-28T19:23:24Z | - |
| dc.date | 2004-05-28T19:23:24Z | - |
| dc.date | 1990-01 | - |
| dc.date.accessioned | 2013-10-09T02:37:47Z | - |
| dc.date.available | 2013-10-09T02:37:47Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | http://hdl.handle.net/1721.1/5107 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | 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 1989a) of a Brownian control problem that approximates (via Harrison's 1988 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. | - |
| dc.format | 751824 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 208-90 | - |
| dc.title | On the Improvement From Scheduling a Two-Station Queueing Network in Heavy Traffic | - |
| dc.type | Working Paper | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.