Two Parallel Queues with Infinite Servers and<i>Join the Shortest Queue</i>Discipline (Q3458140): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/15326349.2015.1061440 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2098147028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3331506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3084090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear integral equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3215519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum queue length in the supermarket model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3897351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shortest Queue Version of the Erlang Loss Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the infinite server shortest queue problem: non-symmetric case / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:56, 11 July 2024

scientific article
Language Label Description Also known as
English
Two Parallel Queues with Infinite Servers and<i>Join the Shortest Queue</i>Discipline
scientific article

    Statements

    Two Parallel Queues with Infinite Servers and<i>Join the Shortest Queue</i>Discipline (English)
    0 references
    8 December 2015
    0 references
    Fredholm integral equations
    0 references
    Markov processes
    0 references
    network performance evaluation
    0 references
    orthogonal polynomials
    0 references
    queuing theory
    0 references
    scheduling
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references