Consider the LPT algorithm for $($P $||$Cmax$).$ If the machine i which processes the job which finishes last, pro$-$

cesses k other jobs, then prove that LPT returns a factor k$+1$

k approximation algorithm