Pages that link to "Item:Q4953248"
From MaRDI portal
The following pages link to On-Line Load Balancing for Related Machines (Q4953248):
Displayed 15 items.
- Online and semi-online hierarchical scheduling for load balancing on uniform machines (Q631770) (← links)
- Online scheduling with rejection and withdrawal (Q650898) (← links)
- On the optimality of list scheduling for online uniform machines scheduling (Q694192) (← links)
- Preemptive scheduling on a small number of hierarchical machines (Q924724) (← links)
- The hierarchical model for load balancing on two machines (Q927189) (← links)
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation (Q927393) (← links)
- Deterministic monotone algorithms for scheduling on related machines (Q952439) (← links)
- Preemptive online scheduling: Optimal algorithms for all speeds (Q1016520) (← links)
- Online scheduling with general machine cost functions (Q1026108) (← links)
- Optimal and online preemptive scheduling on uniformly related machines (Q1041344) (← links)
- A manifesto for the computational method (Q1603721) (← links)
- A lower bound for on-line scheduling on uniformly related machines (Q1970423) (← links)
- Online Scheduling on a CPU-GPU Cluster (Q4922108) (← links)
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios (Q5949924) (← links)
- On-line load balancing of temporary tasks revisited (Q5958311) (← links)