Proof of `Preemption does not help the total weighted completion time` (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
McNaughton's theorem (1959, Theorem 4.1): for every bound on the number of machines, the decision version of reduces to that of with the same kernel instance, the same data in every field except interruption (which has no data), and the same threshold.