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

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.

MoreLess

Year of publication:	1987
Authors:	Daley, D. J.
Published in:	Stochastic Processes and their Applications. - Elsevier, ISSN 0304-4149. - Vol. 25.1987, p. 301-308
Publisher:	Elsevier
Keywords:	queueing discipline G/G/s queues optimality weak majorization work load

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10008874528