Proof of `The Dynamic Program for Day-Independent Due Dates`
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
Processing the clients in due-date order makes the time at which each machine becomes free a sufficient state.