Proof of `Unit Processing Times as a Bipartite Matching Problem` (2nd 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 scheduled job is matched to the slot of its day and due date, a rejected one to one of the rejections its client is allowed.