论文部分内容阅读
The problem of scheduling jobs on uniform parallel machines with makespan ( C max ) minimization objective was studied. Due to its non-deterministic polynomial-time ( N ) hard nature,it is difficult to achieve an optimal solution with traditional optimiza