Sorted-greedy for Load Balancing Problem
Take for instance $m=2$ machines and $n=5$ jobs with processing times $4,3,3,2,2$.


The optimal schedule puts $4+3$ on one machine and $3+2+2$ on the orther machine.
Sorted-greedy assigns $4$ to the first machine, $3$ to the second machine, $3$ to the second machine, $2$ to the first machine, $2$ to the first machine. Hence the loads are $4+2+2$ and $3+3$.