Competitive ratio of list scheduling on uniform machines and randomized heuristics (Q633543): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: New algorithms for an ancient scheduling problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive paging with locality of reference / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for online uniform-machine scheduling to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for List Schedules on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized on-line scheduling on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An On-Line Algorithm for Some Uniform Processor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online randomized multiprocessor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic scheduling on parallel machines / rank
 
Normal rank

Latest revision as of 23:05, 3 July 2024

scientific article
Language Label Description Also known as
English
Competitive ratio of list scheduling on uniform machines and randomized heuristics
scientific article

    Statements

    Competitive ratio of list scheduling on uniform machines and randomized heuristics (English)
    0 references
    0 references
    0 references
    1 April 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    analysis of algorithms
    0 references
    online algorithms
    0 references
    competitive ratio
    0 references
    randomized scheduling
    0 references
    0 references