Pages that link to "Item:Q1016520"

The following pages link to Preemptive online scheduling: Optimal algorithms for all speeds (Q1016520):

Displaying 21 items.

• Lower bounds for online makespan minimization on a small number of related machines (Q398887) (← links)
• Preemptive online scheduling with rejection of unit jobs on two uniformly related machines (Q398903) (← links)
• Robust algorithms for preemptive scheduling (Q472464) (← links)
• Semi-online preemptive scheduling: one algorithm for all variants (Q537921) (← links)
• On the optimality of list scheduling for online uniform machines scheduling (Q694192) (← links)
• On-line scheduling to minimize Max flow time: an optimal preemptive algorithm (Q813965) (← links)
• Optimal and online preemptive scheduling on uniformly related machines (Q1041344) (← links)
• A two-phase algorithm for bin stretching with stretching factor 1.5 (Q1680492) (← links)
• Online bin stretching with three bins (Q1702659) (← links)
• On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints (Q1785422) (← links)
• An optimal algorithm for preemptive on-line scheduling (Q1919176) (← links)
• Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes (Q2059895) (← links)
• A lower bound on deterministic online algorithms for scheduling on related machines without preemption (Q2344208) (← links)
• Optimal preemptive scheduling for general target functions (Q2581760) (← links)
• Semi-online scheduling: a survey (Q2669808) (← links)
• Better Algorithms for Online Bin Stretching (Q3453280) (← links)
• (Q5009506) (← links)
• STACS 2004 (Q5309700) (← links)
• Mathematical Foundations of Computer Science 2004 (Q5311130) (← links)
• Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios (Q5949924) (← links)
• Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)