Comparing ordered-entry queues with heterogeneous servers
This paper discusses a queueing system with m heterogeneous exponential servers with service rates \(\mu_ 1\geq \mu_ 2\geq...\geq \mu_ m\) and a finite buffer with capacity N(\(\geq m)\). Arrivals follow an arbitrary point process. Let \(\pi\) be a permutation of m integers denoting an ``entry order, i.e. any arrival will receive the service from the first unoccupied server according to the order \(\pi\). If all servers are occupied but the buffer is not full, the arrival will join a single queue. The service pattern is FCFS. Once the service is completed, the customer leaves the system forever. If the buffer is full, the arrivals will be blocked and are deemed to be lost. This is precisely an ordered entry \(G/M(\mu_ i)/m/N\) model. This paper contains the best (worst) entry order in terms of minimizing (maximizing) congestion and maximizing (minimizing) the number of processed customers in the sense of stochastic ordering. The results complement previous results regarding the comparison of queues with parallel (homogeneous) servers.
- 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
- 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
- scientific article; zbMATH DE number 3852171 (Why is no real title available?)
- 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
- Markovian queueing systems with retrials and heterogeneous servers
- Design of manufacturing systems using queueing models
- A duality approach to admission and scheduling controls of queues
- Optimality of the fastest available server policy
- Many-server scaling of the N-system under FCFS-ALIS
- Performance-based routing
- Convexity properties of the overflow in an ordered-entry system with heterogeneous servers
- Heterogeneous-server loss systems with ordered entry: An anomaly
- Analysis of \(GI/ M/ n/ n\) queueing system with ordered entry and no waiting line
- A model of channel allocation in multichannel local networks
- On the convexity of loss probabilities when arrivals occur in batches and servers are heterogeneous
- Managing Queues with Heterogeneous Servers
- Server utilization factors in queueing loss systems with ordered entry and heterogeneous servers
- The Arrangement of Servers in an Ordered-Entry System
- Comparisons of multi-server queues with finite waiting rooms
- Stationary blocking probability in multi-server finite queuing system with ordered entry and Poisson arrivals
- On a two-server finite queueing system with ordered entry and deterministic arrivals
- Dynamic routing in large-scale service systems with heterogeneous servers
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)
