Proof of `Relations of the Scheduling Zoo that need an encoding` (6th statement)
groundedproofs/Lax434175Proofs/EncodingsShops.lean · lax-434175
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
A job becomes an operation of length zero on the first machine followed by its operation on the second machine. An instance without machines but with jobs has no schedule and is given an unreachable threshold.