supported by the National Natural Science Foundation of China (70871032;90924021;70971035);the National High Technology Research and Development Program of China (863 Program) (2008AA042901);Anhui Provincial Natural Science Foundation (11040606Q27)
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,proce...