On-Line Load Balancing for Related Machines
From MaRDI portal
Recommendations
Cited in
(47)- Preemptive online scheduling: Optimal algorithms for all speeds
- Online scheduling with general machine cost functions
- Optimal and online preemptive scheduling on uniformly related machines
- A manifesto for the computational method
- A survey on makespan minimization in semi-online environments
- Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
- A two-phase algorithm for bin stretching with stretching factor 1.5
- Online bin stretching with three bins
- A lower bound for on-line scheduling on uniformly related machines
- Starting time minimization for the maximum job variant
- Online makespan scheduling with job migration on uniform machines
- Online scheduling of jobs with favorite machines
- Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
- A lower bound on deterministic online algorithms for scheduling on related machines without preemption
- Rejecting jobs to minimize load and maximum flow-time
- Semi-online scheduling: a survey
- A lower bound on deterministic online algorithms for scheduling on related machines without preemption
- Online minimum makespan scheduling with a buffer
- Online scheduling of mixed CPU-GPU jobs
- Better Algorithms for Online Bin Stretching
- Lower bounds for online makespan minimization on a small number of related machines
- Tight bounds for online vector scheduling
- On-Line Load Balancing of Temporary Tasks on Identical Machines
- Robust algorithms for preemptive scheduling
- Online Scheduling on a CPU-GPU Cluster
- Online makespan minimization: the power of restart
- Online Makespan Scheduling with Job Migration on Uniform Machines
- On-line load balancing for related machines
- Online load balancing on related machines
- Approximating the optimal algorithm for online scheduling problems via dynamic programming
- Minimum congestion mapping in a cloud
- On-line machine covering
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
- On-line load balancing of temporary tasks revisited
- Configuration balancing for stochastic requests
- Well-behaved online load balancing against strategic jobs
- Parallel solutions for preemptive makespan scheduling on two identical machines
- Online and semi-online hierarchical scheduling for load balancing on uniform machines
- Online scheduling with rejection and withdrawal
- Fifty years of research in scheduling -- theory and applications
- On the optimality of list scheduling for online uniform machines scheduling
- Configuration balancing for stochastic requests
- Online speed-robust scheduling
- Preemptive scheduling on a small number of hierarchical machines
- The hierarchical model for load balancing on two machines
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation
- Deterministic monotone algorithms for scheduling on related machines
This page was built for publication: On-Line Load Balancing for Related Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4953248)
