In: Advanced Math
Consider P|rj, prec|Cmax. Show that the greedy algorithm is a 2-approximation.
(It pertains to Scheduling Theory, Algorithms, and Systems.)
if you need any explanation about the answer or have any doubt please comment first, don't dislike the answer. This is the correct proof.