Proof of `Just-in-Time Scheduling on Unrelated Machines as Day-Independent Due Dates` (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
An assignment of the jobs to machines with no two jobs of a machine overlapping is a schedule serving every client once, and conversely.