Batch processor sharing with hyper-exponential service time (Q943802): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the nonoptimality of the foreground-background discipline for IMRL service times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch arrival processor-sharing with application to multi-level processor-sharing scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of the M/G/1 processor-sharing queue with bulk arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The processor‐sharing queueing model for time‐shared systems with bulk arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4134686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharing a Processor Among Many Job Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concavity of the conditional mean sojourn time in the \(M/G/1\) processor-sharing queue with batch arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5814809 / rank
 
Normal rank

Latest revision as of 16:47, 28 June 2024

scientific article
Language Label Description Also known as
English
Batch processor sharing with hyper-exponential service time
scientific article

    Statements