Theoretical computer science · Oct 6, 2026
Polynomial-time scheduling on three identical machines
Resolves the three-processor unit-job scheduling problem of Garey and Johnson: a deterministic polynomial-time algorithm minimizes makespan for nonpreemptive unit-length jobs with arbitrary precedence constraints on three identical parallel machines. For an explicitly given precedence graph, it decides deadline feasibility exactly and constructs a feasible schedule.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model