Throughput maximization in a loss queueing system with heterogeneous servers
From MaRDI portal
DOI10.2307/3214552zbMATH Open0715.60115OpenAlexW2335378017MaRDI QIDQ3201221FDOQ3201221
Authors: Matthew J. Sobel
Publication date: 1990
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3214552
Recommendations
- Maximizing throughput in finite-source parallel queue systems
- Managing Queues with Heterogeneous Servers
- Threshold control policies for heterogeneous server systems
- Server assignment policies for maximizing the steady-state throughput of finite queueing systems
- Heterogeneous-server loss systems with ordered entry: An anomaly
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cited In (11)
- On the Assignment of Customers to Parallel Queues
- Critically loaded queueing models that are throughput suboptimal
- Optimizing data throughput in client/server systems by keeping queue sizes balanced
- Minimizing loss probability in queuing systems with heterogeneous servers
- Asymptotic optimization of limited access queueing systems with losses
- Remarks on the hypercube model
- Prioritized customer order scheduling to maximize throughput
- Maximizing throughput in finite-source parallel queue systems
- Optimality of the fastest available server policy
- Optimal server selection in a queueing loss model with heterogeneous exponential servers, discriminating arrivals, and arbitrary arrival times
- Minimizing expected discounted cost in a queueing loss model with discriminating arrivals
This page was built for publication: Throughput maximization in a loss queueing system with heterogeneous servers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3201221)