Proof of `One family for parallel machines with and without preemption` (2nd statement)
groundedproofs/Lax434175Proofs/ParallelFamily.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 non-preemptive schedule is a schedule with one full piece per job starting at an integral time.