Pages that link to "Item:Q4953248"

The following pages link to On-Line Load Balancing for Related Machines (Q4953248):

Displaying 38 items.

• Lower bounds for online makespan minimization on a small number of related machines (Q398887) (← links)
• Robust algorithms for preemptive scheduling (Q472464) (← links)
• 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 survey on makespan minimization in semi-online environments (Q1617278) (← links)
• Tight upper bounds for semi-online scheduling on two uniform machines with known optimum (Q1642847) (← links)
• A two-phase algorithm for bin stretching with stretching factor 1.5 (Q1680492) (← links)
• Online bin stretching with three bins (Q1702659) (← links)
• A lower bound for on-line scheduling on uniformly related machines (Q1970423) (← links)
• Starting time minimization for the maximum job variant (Q2057591) (← links)
• Online makespan scheduling with job migration on uniform machines (Q2067667) (← links)
• Online scheduling of jobs with favorite machines (Q2289948) (← links)
• Tight lower bounds for semi-online scheduling on two uniform machines with known optimum (Q2323435) (← links)
• A lower bound on deterministic online algorithms for scheduling on related machines without preemption (Q2344208) (← links)
• Rejecting jobs to minimize load and maximum flow-time (Q2409575) (← links)
• Semi-online scheduling: a survey (Q2669808) (← links)
• ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER (Q2929632) (← links)
• ONLINE SCHEDULING OF MIXED CPU-GPU JOBS (Q2941090) (← links)
• Better Algorithms for Online Bin Stretching (Q3453280) (← links)
• Tight Bounds for Online Vector Scheduling (Q4620410) (← links)
• Online Scheduling on a CPU-GPU Cluster (Q4922108) (← links)
• (Q5009506) (← links)
• Online Makespan Scheduling with Job Migration on Uniform Machines (Q5009583) (← links)
• Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming (Q5245846) (← links)
• Minimum Congestion Mapping in a Cloud (Q5258917) (← 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)
• Well-behaved online load balancing against strategic jobs (Q6090218) (← links)
• Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)