While this submission is a draft, it cannot be used by other submissions.

Proof of `Machine sets encoded by long processing times` (4th statement)

groundedproofs/Lax434175Proofs/EncodingsEligibility.lean · lax-434175

What this proof establishes

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

A machine outside the set of a job gets the time dj+1d_j + 1; the jobs outside their sets are not just in time and are moved to the end.