OP-00487 Open Polynomial-factor hardness of scheduling unit jobs on prescribed machines OC · AIM Open Applied Problems · hardness of approximation · precedence constraints · scheduling
OP-00488 Open Beat factor two for scheduling on unrelated machines OC · AIM Open Applied Problems · approximation algorithms · scheduling · unrelated parallel machines
OP-00728 Solution claimed Exact complexity of unit-job precedence scheduling on three processors OC · AIM Open Applied Problems · computational complexity · makespan · precedence-constrained scheduling