Observing general service queues before joining (Q1919196): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: David A. Stanford / rank
Normal rank
 
Property / author
 
Property / author: Myron Hlynka / rank
Normal rank
 
Property / author
 
Property / author: David A. Stanford / rank
 
Normal rank
Property / author
 
Property / author: Myron Hlynka / rank
 
Normal rank
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.1016/0167-6377(95)00056-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046057849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of the asymmetric shortest queue problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest queue model with jockeying / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO QUEUES IN PARALLEL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Observing Queues Before Joining / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matrix-geometric solution of the jockeying problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Similar Queues in Parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3923308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterising interdeparture times for bursty input streams in the queue with pooled renewal arrivals / rank
 
Normal rank

Latest revision as of 13:52, 24 May 2024

scientific article
Language Label Description Also known as
English
Observing general service queues before joining
scientific article

    Statements

    Observing general service queues before joining (English)
    0 references
    3 February 1997
    0 references
    0 references
    join the shortest queue
    0 references
    joining strategies
    0 references
    hyperexponential distribution
    0 references
    parallel queues
    0 references
    0 references
    0 references
    0 references