OP-00487 Open Polynomial-factor hardness of scheduling unit jobs on prescribed machines OC · AIM Open Applied Problems · hardness of approximation · precedence constraints · scheduling