Proof of `One family for shops with and without preemption` (4th statement)
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 shop schedule is a schedule with one full piece per operation starting at an integral time.