I am trying to understand the optimality proof of the earliest finish time algorithm. I have attached the pdf which I am reading. It's just 2 pages. I don't understand what they mean with solution still feasible and optimal (but contradicts maximality of r). An explanation from scratch would be nice...