论文部分内容阅读
A precedence order is defined based on the release dates of jobsdirect 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,Tj,outtree|∑ Cj.The new algorithm is shown to be more compact and easier to implement.