The following special case of the classical NP-hard scheduling problem 1| r_j | Lmax is considered. There is a set of jobs N = {1, 2, ..., n} with identical processing times p_j = p for all jobs j. All jobs have to be processed on a single machine. The optimization criterion is the minimization of maximum lateness Lmax. We analyze algorithms for the makespan problem 1| r_j |Cmax, presented by Garey et al. (1981) and Simons (1978) and give two polynomial algorithms to solve the problem under consideration and to construct the Pareto set with respect to the criteria Lmax and Cmax. The complexity of the presented algorithms is O(Q
n log n) and O(n^2 log n), respectively, where 10^(-􀀀)Q is the accuracy of the input-output parameters.