Proof of `Day-Independent Due Dates and Processing Times` (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 feasible schedule meets a clique in at most one client per day, and a proper colouring serves its classes in rotation.