An exponential queue with competition for service (Q5928449): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A single server n-line queue in which a customer may receive special treatment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3938929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3920345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Observing Queues Before Joining / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Observing general service queues before joining / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(99)00313-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055985121 / rank
 
Normal rank

Latest revision as of 11:31, 30 July 2024

scientific article; zbMATH DE number 1582681
Language Label Description Also known as
English
An exponential queue with competition for service
scientific article; zbMATH DE number 1582681

    Statements

    An exponential queue with competition for service (English)
    0 references
    0 references
    0 references
    28 March 2001
    0 references
    0 references
    Ballot theorem
    0 references
    Laplace-Stieltjes transform
    0 references
    computational algorithm
    0 references
    \(M/M/c\) queue
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references