General solutions of the jockeying problem (Q1062686): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A solution for queues with instantaneous jockeying and other customer selection rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Jockeying in Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal customer decisions in a G/M/c queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3282332 / rank
 
Normal rank

Latest revision as of 18:47, 14 June 2024

scientific article
Language Label Description Also known as
English
General solutions of the jockeying problem
scientific article

    Statements

    General solutions of the jockeying problem (English)
    0 references
    1985
    0 references
    We consider a multi-server queue where units are allowed to jockey among queues. General solutions of the steady-state and transient-state jockeying systems are obtained. The effect of the queue parameters on the measures of the system's performance are presented. Solutions of the multi-server jockeying systems with state dependent arrival and service rates are also obtained. It is found that queueing systems where jockeying is allowed have superior measures of performance than those of M/M/c or non-jockeying systems.
    0 references
    numerical analysis
    0 references
    multi-server queue
    0 references
    steady-state
    0 references
    transient-state jockeying systems
    0 references
    system's performance
    0 references
    0 references
    0 references

    Identifiers