Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines

This paper considers the problem of scheduling n independent jobs on m uniform parallel machines, with the aim of minimizing the total weighted completion time. We present two hybrid meta-heuristics to solve this problem. Based on a large set of instances, an experimental study has been carried out to evaluate our methods.