Comparing ordered-entry queues with heterogeneous servers (Q1116560): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: David D. W. Yao / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: V. Thangaraj / rank
Normal rank
 
Property / author
 
Property / author: David D. W. Yao / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: V. Thangaraj / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the comparison of point processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic inequalities on partially ordered spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities: theory of majorization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on many-server queueing systems with ordered entry, with an application to conveyor theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Server utilization factors in queueing loss systems with ordered entry and heterogeneous servers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing multi-server queues with finite waiting rooms, I: Same number of servers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3321201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing counting processes and queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial orderings of permutations and monotonicity of a rank correlation statistic / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:25, 19 June 2024

scientific article
Language Label Description Also known as
English
Comparing ordered-entry queues with heterogeneous servers
scientific article

    Statements

    Comparing ordered-entry queues with heterogeneous servers (English)
    0 references
    0 references
    0 references
    1987
    0 references
    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.
    0 references
    queues with ordered entry
    0 references
    sample path comparison
    0 references
    finite buffer
    0 references
    point process
    0 references
    comparison of queues
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references