Optimal online algorithms on two hierarchical machines with tightly-grouped processing times (Q2343998): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On-Line Load Balancing in a Hierarchical Server Topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hierarchical model for load balancing on two machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line algorithms for the channel assignment problem in cellular networks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling on a small number of hierarchical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi on-line scheduling on two identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on parallel machines with two goS levels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal online algorithms for scheduling on two identical machines under a grade of service / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online and semi-online scheduling of two machines under a grade of service provision / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on hierarchical scheduling on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online hierarchical scheduling: an approach using mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online parallel machines scheduling with two hierarchies / rank
 
Normal rank

Latest revision as of 01:21, 10 July 2024

scientific article
Language Label Description Also known as
English
Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
scientific article

    Statements

    Optimal online algorithms on two hierarchical machines with tightly-grouped processing times (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 May 2015
    0 references
    online scheduling
    0 references
    hierarchy
    0 references
    competitive ratio
    0 references

    Identifiers