 ┌──────────────────────────────┐
 │ ####::######..####::::###### │
 │ ::########::....######::##.. │
 │ ##....##########::####....## │
 └─────────────────────────[@]──┘

01 / Feasible

Feasible

Rules in, schedule out, with proof.

Write the rules in plain language. Feasible turns them into a schedule and signs a certificate that anyone can re-check offline.

481 tests, including a suite that tries to forge certificates

source on GitHub

01 Before and after

Before: a written procedure. After: a valid schedule, and every assignment cites the sentence it came from.

02 How it works

CP-SAT builds the plan. Z3 checks it independently. An Ed25519 signature seals the result, so anyone can re-check the certificate offline.

03 The moment

It caught an illegal 23:30 cleanout and quoted the clause that forbids it.

04 Two domains

Job shop and datacenter capacity.

Feasible planner showing a machine schedule as a timeline — The planner on the job shop scenario.

Feasible planner showing datacenter capacity over time against its redundancy floor — The planner on the datacenter scenario.

05 By the numbers

481 tests in the public repo.
46 of them in the suite that tries to forge certificates.
About 8.2k lines of solver code and 8.7k lines of tests.