A lower bound on deterministic online algorithms for scheduling on related machines without preemption (Q2344208): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-013-9451-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1984292487 / rank
 
Normal rank
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: On-Line Load Balancing for Related Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on three uniform machines / 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: Semi-online preemptive scheduling: one algorithm for all variants / 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: 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: On the optimality of list scheduling for online uniform machines scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for online makespan minimization on a small number of related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive ratio of list scheduling on uniform machines and randomized heuristics / rank
 
Normal rank

Latest revision as of 02:29, 10 July 2024

scientific article
Language Label Description Also known as
English
A lower bound on deterministic online algorithms for scheduling on related machines without preemption
scientific article

    Statements

    A lower bound on deterministic online algorithms for scheduling on related machines without preemption (English)
    0 references
    0 references
    0 references
    12 May 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    online algorithms
    0 references
    scheduling
    0 references
    makespan
    0 references
    uniformly related machines
    0 references
    lower bounds
    0 references
    0 references