Proof of `The dynamic program for interval scheduling, and its state space` (3rd statement)
groundedproofs/Lax470956Proofs/DynamicProgram.lean · lax-470956
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
At the horizon every job has finished, so the only reachable state is the idle one, and the weight of the jobs started by then is the weight of the whole schedule.