Lower bounds for online makespan minimization on a small number of related machines
From MaRDI portal
Publication:398887
DOI10.1007/S10951-012-0288-7zbMATH Open1297.90048OpenAlexW2129652129MaRDI QIDQ398887FDOQ398887
Authors: Łukasz Jeż, Jarett Schwartz, Jiří Sgall, József Békési 
Publication date: 18 August 2014
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-012-0288-7
Recommendations
- A lower bound on deterministic online algorithms for scheduling on related machines without preemption
- A better lower bound for on-line scheduling
- Improved Bounds for the Online Scheduling Problem
- Online scheduling on unbounded parallel-batch machines to minimize the makespan
- A lower bound on deterministic online algorithms for scheduling on related machines without preemption
Cites Work
- On-line scheduling revisited
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Bounds for Certain Multiprocessing Anomalies
- Title not available (Why is that?)
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- Bounds for List Schedules on Uniform Processors
- Randomized on-line scheduling on two uniform machines
- Preemptive online scheduling: Optimal algorithms for all speeds
- New algorithms for related machines with temporary jobs.
- New lower and upper bounds for on-line scheduling
- A lower bound for on-line scheduling on uniformly related machines
- A lower bound on deterministic online algorithms for scheduling on related machines without preemption
- On-Line Load Balancing for Related Machines
- Semi-online preemptive scheduling: one algorithm for all variants
- Competitive ratio of list scheduling on uniform machines and randomized heuristics
- On the optimality of list scheduling for online uniform machines scheduling
- Online scheduling on three uniform machines
Cited In (5)
- A survey on makespan minimization in semi-online environments
- Semi-online scheduling on two uniform parallel machines with initial lookahead
- A lower bound on deterministic online algorithms for scheduling on related machines without preemption
- Improved Bounds for the Online Scheduling Problem
- Parallel solutions for preemptive makespan scheduling on two identical machines
This page was built for publication: Lower bounds for online makespan minimization on a small number of related machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398887)
