The Dependence of Optimal Returns from Multi-class Queueing Systems on Their Customer Base

Authors:
M. J. Dacre;K. D. Glazebrook
Affiliations:
Department of Statistics, Newcastle University, Newcastle upon Tyne NE1 7RU, UK;Department of Statistics, Newcastle University, Newcastle upon Tyne NE1 7RU, UK
Venue:
Queueing Systems: Theory and Applications
Year:
2002

Citing 5
Cited 1

Optimal load balancing and scheduling in a distributed computer system

Journal of the ACM (JACM)
Multiclass queueing systems: polymatroidal structure and optimal scheduling control

Operations Research - Supplement to Operations Research: stochastic processes
Rearrangement, majorization and stochastic scheduling

Mathematics of Operations Research
Conservation laws, extended polymatroids and multiarmed bandit problems; a polyhedral approach to indexable systems

Mathematics of Operations Research
Submodular Returns and Greedy Heuristics for Queueing Scheduling Problems

Operations Research

Stochastic scheduling on parallel machines to minimize discounted holding costs

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

We identify structured collections of multi-class queueing systems whose optimal return (a minimised cost) is a supermodular function of the set of customer classes allowed external access to the system. Our results extend considerably the range of systems for which such a claim can be made. The returns from such systems also exhibit a form of directional convexity when viewed as functions of a vector of arrival rates. Applications to load balancing problems are indicated.