Optimal and online preemptive scheduling on uniformly related machines (Q1041344): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On-line routing of virtual circuits with applications to load balancing and machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for related machines with temporary jobs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Load Balancing for Related Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for preemptive on-line scheduling / 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: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Independent Tasks on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive online scheduling: Optimal algorithms for all speeds / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin stretching revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal preemptive semi-online scheduling to minimize makespan on two related machines / 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: A lower bound for on-line scheduling on uniformly related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter Bounds for LPT Scheduling on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Uniform Processor Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Level Algorithm for Preemptive Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan and preemption costs on a system of uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Parallel Machines On-Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive on-line scheduling for two uniform processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comment on scheduling on uniform machines under chain-type precedence constraints / rank
 
Normal rank

Revision as of 05:29, 2 July 2024

scientific article
Language Label Description Also known as
English
Optimal and online preemptive scheduling on uniformly related machines
scientific article

    Statements

    Optimal and online preemptive scheduling on uniformly related machines (English)
    0 references
    0 references
    0 references
    2 December 2009
    0 references
    online scheduling
    0 references
    preemption
    0 references
    uniformly related machines
    0 references
    0 references
    0 references

    Identifiers