A deterministic polynomial-time algorithm finds a minimum-makespan schedule for unit-length jobs with arbitrary acyclic precedence constraints on three identical parallel machines.
A deterministic polynomial-time algorithm finds a minimum-makespan schedule for unit-length jobs with arbitrary acyclic precedence constraints on three identical parallel machines.
A deterministic polynomial-time algorithm finds a minimum-makespan schedule for unit-length jobs with arbitrary acyclic precedence constraints on three identical parallel machines.
If correct, gives an exact efficient algorithm for a long-standing scheduling case.
Can optimal schedules be found in polynomial time for the stated three-machine case?
Publication dates and editorial changes.
OpenAI reports polynomial-time optimal three-machine unit-job scheduling
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
