Parse
Validate every submission against the canonical JSON schema.
A benchmark for schedules that have to work
GanttBench evaluates machine-readable project schedules—not just plausible timeline pictures. It checks whether tasks, calendars, dependencies, milestones, deadlines, and replans remain structurally valid.
Small enough to inspect. Explicit enough to reproduce.
Brief in. Evidence out.
A convincing bar chart can still hide impossible dates, missing work, broken dependencies, or a replan that quietly drops constraints.
GanttBench converts each case into explicit predicates and applies them to a canonical schedule. The primary score uses deterministic checks—no embeddings and no LLM judge.
Validate every submission against the canonical JSON schema.
Resolve required tasks one-to-one with stable keys and curated aliases.
Run global integrity checks and case-specific requirement predicates.
Return scores, failures, explanations, and machine-readable evidence.
Every submission faces the same artifact-level invariants before its case-specific requirements are scored.
Three system classes share one canonical contract, so assistance from a scheduler is visible instead of being folded into the model score.
modelThe model translates a project brief directly into the canonical schedule schema.
solver_assistedA model formulates the constraints; a scheduling engine computes the plan.
artifact_agentAn agent creates or edits a native project artifact before an adapter emits the canonical schema.
Status / 2026Today, the repository implements the shared canonical schedule layer. Native-file adapters and broader track runners are planned.
Strict success is the headline: every hard check must pass. Partial scores remain visible as diagnostics, never as a substitute for validity.
{
"strict_success": true,
"score": 1.0,
"requirements_score": 1.0,
"integrity_score": 1.0,
"checks": [
{
"id": "integrity:dependency_timing",
"passed": true,
"severity": "hard",
"evidence": { "errors": [] }
}
]
}Cases can evaluate explicit predicates—duration ranges, dependency semantics, deadlines, and preservation—instead of whole-file equality. Different plans can pass when they satisfy the same declared constraints.
Explore the evaluator, run the example cases, and help define the next layer of rigorous project-schedule evaluation.
Explore the repository