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: | Ou, Jihong, Wein, Lawrence M. |
---|---|
Format: | Working Paper |
Language: | en_US |
Published: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
Online Access: | http://hdl.handle.net/1721.1/5216 |
Similar Items
-
On the Improvement From Scheduling a Two-Station Queueing Network in Heavy Traffic
by: Ou, Jihong, et al.
Published: (2004) -
Dynamic scheduling of queueing networks
by: Ou, Jihong
Published: (2005) -
Scheduling network of queues : heavy traffic analysis of multistation network with controllable inputs
by: Wein, Lawrence M.
Published: (2009) -
Scheduling a two-station multiclass queueing network in heavy traffic
by: Wein, Lawrence M.
Published: (2009) -
Scheduling of multiclass queueing networks : bounds on achievable performance
by: Paschalidis, Ioannis Ch
Published: (2005)