This paper considers the uniform parallel machine scheduling problem which is to minimize the maximum lateness. This problem is equivalent to the uniform parallel machine scheduling problem, which is to minimize the maximal completion time of n jobs whose release times are zero, processing times depend on the speed of the machine to which they are assigned… (More)

Scheduling jobs with release dates and tails on identical parallel machines to minimize the makespan, European Journal of Operational Research 29 298–306