When random-order-of-service outperforms first-come-first-served (Q1785418): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The equivalence between processor sharing and service in random order. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distribution of the number of customers in the symmetric M/G/1 queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: The waiting time distribution for the random order service \(M/M/1\) queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3855869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4134686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a processor sharing queue that models balking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine Repair as a Priority Waiting-Line Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Queue <i>M</i>/<i>G</i>/1 with the Shortest Remaining Processing Time Discipline / rank
 
Normal rank

Revision as of 16:48, 16 July 2024

scientific article
Language Label Description Also known as
English
When random-order-of-service outperforms first-come-first-served
scientific article

    Statements

    When random-order-of-service outperforms first-come-first-served (English)
    0 references
    28 September 2018
    0 references
    scheduling policies
    0 references
    Markov-modulated Poisson process
    0 references
    first-come-first-served
    0 references
    random-order-of-service
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers