Performance Bounds for Scheduling Queueing Networks
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...
| Main Authors: | , |
|---|---|
| Format: | Working Paper |
| Language: | en_US |
| Published: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
| Online Access: | http://hdl.handle.net/1721.1/5216 |
| _version_ | 1811091766441410560 |
|---|---|
| author | Ou, Jihong Wein, Lawrence M. |
| author_facet | Ou, Jihong Wein, Lawrence M. |
| author_sort | Ou, Jihong |
| collection | MIT |
| 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. |
| first_indexed | 2024-09-23T15:07:22Z |
| format | Working Paper |
| id | mit-1721.1/5216 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T15:07:22Z |
| publishDate | 2004 |
| publisher | Massachusetts Institute of Technology, Operations Research Center |
| record_format | dspace |
| spelling | mit-1721.1/52162019-04-12T08:16:07Z Performance Bounds for Scheduling Queueing Networks Ou, Jihong Wein, Lawrence M. 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. 2004-05-28T19:28:31Z 2004-05-28T19:28:31Z 1990-09 Working Paper http://hdl.handle.net/1721.1/5216 en_US Operations Research Center Working Paper;OR 227-90 1706212 bytes application/pdf application/pdf Massachusetts Institute of Technology, Operations Research Center |
| spellingShingle | Ou, Jihong Wein, Lawrence M. Performance Bounds for Scheduling Queueing Networks |
| title | Performance Bounds for Scheduling Queueing Networks |
| title_full | Performance Bounds for Scheduling Queueing Networks |
| title_fullStr | Performance Bounds for Scheduling Queueing Networks |
| title_full_unstemmed | Performance Bounds for Scheduling Queueing Networks |
| title_short | Performance Bounds for Scheduling Queueing Networks |
| title_sort | performance bounds for scheduling queueing networks |
| url | http://hdl.handle.net/1721.1/5216 |
| work_keys_str_mv | AT oujihong performanceboundsforschedulingqueueingnetworks AT weinlawrencem performanceboundsforschedulingqueueingnetworks |