On the superiority of a backward approach in list scheduling algorithms for multi-machine makespan problems