Uniform parallel machine scheduling with resource consumption constraint

We consider the makespan problem on uniform parallel machines, given that some resource consumption cannot exceed a certain level. Several meta-heuristic methods are proposed to generate approximate solutions. Computational results are also provided to demonstrate the performance of the proposed heuristic algorithms.