Proof of `Unit Processing Times as a Bipartite Matching Problem` (1st 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
With unit processing times a job occupies the single time unit ending at its due date.