We consider a basic problem of scheduling n equal-length jobs with release times on a group of m uniform machines with the objective to minimize the maximum job completion time, the makespan. According to our understanding, the status of this problem remained open. Here we propose a fast heuristic algorithm that solves the problem.