Semi-online scheduling with known maximum job size on two uniform machines (Q613661): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A linear compound algorithm for uniform machine 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: Optimal non-preemptive semi-online scheduling on two related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling with ``end of sequence'' information / 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: Bounds for LPT Schedules on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Approximate Algorithms for Scheduling Nonidentical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5427338 / 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: Semi-on-line scheduling with ordinal data on two uniform machines / rank
 
Normal rank

Latest revision as of 14:49, 3 July 2024

scientific article
Language Label Description Also known as
English
Semi-online scheduling with known maximum job size on two uniform machines
scientific article

    Statements