This paper considers the uniform parallel machine scheduling problem with unequal release dates and delivery times to minimize the maximum completion time.For this NP-hard problem,the largest sum of release date,processing time and delivery time first rule is designed to determine a certain machine for each job,and the largest difference between delivery time and release date first rule is designed to sequence the jobs scheduled on the same machine,and then a novel algorithm for the scheduling problem is built.To evaluate the performance of the proposed algorithm,a lower bound for the problem is proposed.The accuracy of the proposed algorithm is tested based on the data with problem size varying from 200 jobs to 600 jobs.The computational results indicate that the average relative error between the proposed algorithm and the lower bound is only 0.667%,therefore the solutions obtained by the proposed algorithm are very accurate. This paper considers the uniform parallel machine scheduling problem with unequal release dates and delivery times to minimize the maximum completion time.For this NP-hard problem, the largest sum of release date, processing time and delivery time first rule is designed to determine a certain machine for each job, and the largest difference between delivery time and release date first rule is designed to sequence the jobs scheduled on the same machine, and then a novel algorithm for the scheduling problem is built. To evaluate the performance of the proposed algorithm, a lower bound for the problem is proposed. The accuracy of the proposed algorithm is tested based on the data with problem size varying from 200 jobs to 600 jobs.The computational results that that the average relative error between the proposed algorithm and the lower bound is only 0.667%, therefore the solutions obtained by the proposed algorithm are very accurate.