In this paper we present a new heuristic algorithm to minimize the makespan for scheduling jobs on unrelated parallel machines with machine eligibility restrictions ( R^ I M .1 C^^). To the best of our knowledge, the ...