Maximizing Throughput in Queueing Networks with Limited Flexibility

DOI10.1007/11682462_38zbMath1145.90352OpenAlexW1522639526MaRDI QIDQ3525776

George Karakostas, Douglas G. Down

Publication date: 18 September 2008

Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11682462_38

zbMATH Keywords

schedulingqueueing networksapproximation algorithms

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36) Approximation algorithms (68W25)

Related Items (1)

Maximizing throughput in queueing networks with limited flexibility

This page was built for publication: Maximizing Throughput in Queueing Networks with Limited Flexibility