Majorization and arrangement orderings in open queueing networks
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Detail(s)
| Original language | English |
|---|---|
| Pages (from-to) | 531-543 |
| Journal / Publication | Annals of Operations Research |
| Volume | 9 |
| Issue number | 1 |
| Publication status | Published - Dec 1987 |
| Externally published | Yes |
Link(s)
Abstract
Consider an open Jackson network of queues. Majorization and arrangement orderings are studied to order, respectively, various loading and server-assignment policies. It is shown that under these order relations, stochastic and likelihood ratio orderings can be established for the maximum and the minimum queue lengths and for the total number of jobs in the network. Stochastic majorization and stochastic orderings are also established, respectively, for the queue-length vector and the associated order-statistic vector. Implications of the results on loading and assignment decisions are discussed. © 1987 J.C. Baltzer A.G., Scientific Publishing Company.
Research Area(s)
- arrangement ordering, Jackson network, likelihood ratio ordering, majorization, stochastic ordering
Citation Format(s)
Majorization and arrangement orderings in open queueing networks. / Yao, D. D.
In: Annals of Operations Research, Vol. 9, No. 1, 12.1987, p. 531-543.
In: Annals of Operations Research, Vol. 9, No. 1, 12.1987, p. 531-543.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
