What was already known
The corresponding problem was polynomial-time solvable on two machines, while the three-machine case with arbitrary precedence constraints was unresolved in the manuscript’s account.
AI involvement
OpenAI credits itself as manuscript author and states that its internal frontier model produced the results in this release. Individual human input is not detailed enough to establish task-only autonomy.
OpenAI is named as author on the manuscript, and its release attributes the results to an internal frontier model. The individual human input is not detailed enough to establish autonomy.
Importance
Gives an exact efficient algorithm for a long-standing scheduling case.
Limitations
The claim is for unit-length jobs, three identical machines, and acyclic precedence constraints. OpenAI reports the Lean check; it was not rerun here.
Technical verification
OpenAI reports a Lean proof matching the selected claim.
Formal checking
The pinned Lean note covers an exact deterministic polynomial-time algorithm for the stated three-machine unit-job scheduling problem.
- Checker
- OpenAI-reported Lean 4 / Comparator
- Scope
- A deterministic polynomial-time algorithm finds a minimum-makespan schedule for unit-length jobs with arbitrary acyclic precedence constraints on three identical parallel machines.
- Basis
- Reported by the linked checker
Checking a formal statement does not establish that it matches the original problem.
Human understanding
Few is the default when evidence for a higher level is insufficient. No named person is documented as explaining the central argument for this assessed contribution.
Correction and publication history
Primary manuscript, attribution, prior-work, and scoped checking review for non-notifying local inclusion.
Read this published revision