Comparing ordered-entry queues with heterogeneous servers
From MaRDI portal
Recommendations
- A comparison of stochastically ordered queues
- On performance characteristics for queueing systems with heterogeneous servers
- Heterogeneous Multiserver Queues With General Input
- Stochastic comparisons for bulk queues
- Server utilization factors in queueing loss systems with ordered entry and heterogeneous servers
- Stochastic comparisons for single-server queues
- Multi-server accumulating priority queues with heterogeneous servers
- A tollbooth tandem queue with heterogeneous servers
- Some comparability results for waiting times in single- and many-server queues
- Comparisons of \(G/G/1\) queues
Cites work
- scientific article; zbMATH DE number 3852171 (Why is no real title available?)
- A note on many-server queueing systems with ordered entry, with an application to conveyor theory
- Comparing counting processes and queues
- Comparing multi-server queues with finite waiting rooms, I: Same number of servers
- Inequalities: theory of majorization and its applications
- On the comparison of point processes
- Partial orderings of permutations and monotonicity of a rank correlation statistic
- Server utilization factors in queueing loss systems with ordered entry and heterogeneous servers
- Stochastic inequalities on partially ordered spaces
Cited in
(18)- Analysis of \(GI/ M/ n/ n\) queueing system with ordered entry and no waiting line
- Markovian queueing systems with retrials and heterogeneous servers
- Design of manufacturing systems using queueing models
- Managing Queues with Heterogeneous Servers
- Comparisons of multi-server queues with finite waiting rooms
- Server utilization factors in queueing loss systems with ordered entry and heterogeneous servers
- A model of channel allocation in multichannel local networks
- A duality approach to admission and scheduling controls of queues
- Stationary blocking probability in multi-server finite queuing system with ordered entry and Poisson arrivals
- Performance-based routing
- Convexity properties of the overflow in an ordered-entry system with heterogeneous servers
- Dynamic routing in large-scale service systems with heterogeneous servers
- The Arrangement of Servers in an Ordered-Entry System
- On the convexity of loss probabilities when arrivals occur in batches and servers are heterogeneous
- Optimality of the fastest available server policy
- Heterogeneous-server loss systems with ordered entry: An anomaly
- Many-server scaling of the N-system under FCFS-ALIS
- On a two-server finite queueing system with ordered entry and deterministic arrivals
This page was built for publication: Comparing ordered-entry queues with heterogeneous servers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1116560)
