Online Makespan Scheduling with Job Migration on Uniform Machines (Q5009583): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
label / enlabel / en
 
Online Makespan Scheduling with Job Migration on Uniform Machines
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Bounds for Online Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the value of job migration in online makespan minimization / 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 an ancient scheduling problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better lower bound for on-line scheduling / 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: New lower and upper bounds for on-line scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for online scheduling with bounded rearrangement at the end / rank
 
Normal rank
Property / cites work
 
Property / cites work: ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with a buffer on related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Online Scheduling with Reordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with rearrangement on two related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on deterministic online algorithms for scheduling on related machines without preemption / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Reordering for Online Minimum Makespan Scheduling / 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: Max-min Online Allocations with a Reordering Buffer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3031924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling revisited / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Better Algorithm for an Ancient Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi on-line algorithms for the partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on two uniform machines to minimize the makespan / 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: Q4821818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for the Online Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling with Bounded Migration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with reassignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with one rearrangement at the end: revisited / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/9489/pdf/LIPIcs-ESA-2018-26.pdf/ / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2889114784 / rank
 
Normal rank
Property / title
 
Online Makespan Scheduling with Job Migration on Uniform Machines (English)
Property / title: Online Makespan Scheduling with Job Migration on Uniform Machines (English) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:22, 30 July 2024

scientific article; zbMATH DE number 7378696
Language Label Description Also known as
English
Online Makespan Scheduling with Job Migration on Uniform Machines
scientific article; zbMATH DE number 7378696

    Statements

    0 references
    0 references
    0 references
    4 August 2021
    0 references
    0 references
    online algorithms
    0 references
    competitive analysis
    0 references
    minimum makespan scheduling
    0 references
    job migration
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Online Makespan Scheduling with Job Migration on Uniform Machines (English)
    0 references