On the Improvement From Scheduling a Two-Station Queueing Network in Heavy Traffic
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 object...
| 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/5107 |
| _version_ | 1826216844168527872 |
|---|---|
| author | Ou, Jihong Wein, Lawrence M. |
| author_facet | Ou, Jihong Wein, Lawrence M. |
| author_sort | Ou, Jihong |
| collection | MIT |
| 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. |
| first_indexed | 2024-09-23T16:54:01Z |
| format | Working Paper |
| id | mit-1721.1/5107 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T16:54:01Z |
| publishDate | 2004 |
| publisher | Massachusetts Institute of Technology, Operations Research Center |
| record_format | dspace |
| spelling | mit-1721.1/51072019-04-12T08:16:41Z On the Improvement From Scheduling a Two-Station Queueing Network in Heavy Traffic Ou, Jihong Wein, Lawrence M. 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. 2004-05-28T19:23:24Z 2004-05-28T19:23:24Z 1990-01 Working Paper http://hdl.handle.net/1721.1/5107 en_US Operations Research Center Working Paper;OR 208-90 751824 bytes application/pdf application/pdf Massachusetts Institute of Technology, Operations Research Center |
| spellingShingle | Ou, Jihong Wein, Lawrence M. On the Improvement From Scheduling a Two-Station Queueing Network in Heavy Traffic |
| title | On the Improvement From Scheduling a Two-Station Queueing Network in Heavy Traffic |
| title_full | On the Improvement From Scheduling a Two-Station Queueing Network in Heavy Traffic |
| title_fullStr | On the Improvement From Scheduling a Two-Station Queueing Network in Heavy Traffic |
| title_full_unstemmed | On the Improvement From Scheduling a Two-Station Queueing Network in Heavy Traffic |
| title_short | On the Improvement From Scheduling a Two-Station Queueing Network in Heavy Traffic |
| title_sort | on the improvement from scheduling a two station queueing network in heavy traffic |
| url | http://hdl.handle.net/1721.1/5107 |
| work_keys_str_mv | AT oujihong ontheimprovementfromschedulingatwostationqueueingnetworkinheavytraffic AT weinlawrencem ontheimprovementfromschedulingatwostationqueueingnetworkinheavytraffic |