Certain optimality properties of the first-come first-served discipline for G/G/s queues

D. J. Daley

Stochastic Processes and their Applications, 1987, vol. 25, 301-308

Abstract: It is shown that for many server queueing systems in which arrivals are allocated to servers in a manner that does not depend on their service times, the vector of work-loads or virtual waiting times is least in the sense of weak majorization when the discipline is first-come first-served. Thus, the maximum work-load and the total work-load are minimized under this "intuitively obvious" minimizing discipline.

Keywords: queueing; discipline; G/G/s; queues; optimality; weak; majorization; work; load (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0304-4149(87)90208-0
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:spapps:v:25:y:1987:i::p:301-308

Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Stochastic Processes and their Applications is currently edited by T. Mikosch

More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().