Pages that link to "Item:Q537921"

The following pages link to Semi-online preemptive scheduling: one algorithm for all variants (Q537921):

Displaying 10 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)
• A survey on makespan minimization in semi-online environments (Q1617278) (← links)
• On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints (Q1785422) (← links)
• A lower bound on deterministic online algorithms for scheduling on related machines without preemption (Q2344208) (← links)
• Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218) (← links)
• The online knapsack problem: advice and randomization (Q2437775) (← links)
• Semi-online scheduling: a survey (Q2669808) (← links)
• (Q5075776) (← links)
• Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)