论文部分内容阅读
A precedence order is defined based on the release dates of jobs’direct successors.Using the defined precedence order and Heap Sort,a new polynomial algorithm is provided which aims to solve the parallel scheduling problem P|pj=1,rj,outtree|Cj.The new alg