Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5216Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Ou, Jihong | - |
| dc.creator | Wein, Lawrence M. | - |
| dc.date | 2004-05-28T19:28:31Z | - |
| dc.date | 2004-05-28T19:28:31Z | - |
| dc.date | 1990-09 | - |
| dc.date.accessioned | 2013-10-09T02:38:27Z | - |
| dc.date.available | 2013-10-09T02:38:27Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | http://hdl.handle.net/1721.1/5216 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | The goal of this paper is to assess the improvement in performance that might' be achieved by optimally scheduling a multiclass open queueing network. A stochastic process is defined whose steady-state mean value is less than or equal to the mean number of customers in a queueing network under any arbitrary scheduling policy. Thus, this process offers a lower bound on performance when the objective of the queueing network scheduling problem is to minimize the mean number of customers in the network. Since this bound is easily obtained from a computer simulation model of a queueing network, its main use is to aid job-shop schedulers in determining how much further improvement (relative to their proposed policies) might be achievable from scheduling. Through computational examples, we identify some factors that affect the tightness of the bound. | - |
| dc.format | 1706212 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 227-90 | - |
| dc.title | Performance Bounds for Scheduling Queueing Networks | - |
| 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.