Earliest-deadline-first service in heavy-traffic acyclic networks. (Q1879911): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3794956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4269108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5522002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of earliest-due-date, first-served queueing networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time queues in heavy traffic with earliest-deadline-first queue discipline / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3721531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4842991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple-input heavy-traffic real-time queues. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heavy Traffic Analysis of Dynamic Cyclic Policies: A Unified Treatment of the Single Machine Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3240992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse / rank
 
Normal rank

Latest revision as of 20:47, 6 June 2024

scientific article
Language Label Description Also known as
English
Earliest-deadline-first service in heavy-traffic acyclic networks.
scientific article

    Statements

    Earliest-deadline-first service in heavy-traffic acyclic networks. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 September 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    heavy traffic analysis
    0 references
    multi-class acyclic queueing networks
    0 references
    workload process
    0 references
    0 references
    0 references