A kind of heap sorting method based on array sorting was proposed. Some advantages and disadvantages of it were discussed. It was compared with the traditional method of direct application. In the method, the ordered ...A kind of heap sorting method based on array sorting was proposed. Some advantages and disadvantages of it were discussed. It was compared with the traditional method of direct application. In the method, the ordered keywords in the array are put into the heap one by one after building an empty heap. This method needs relatively less space and is fit for ordered sequence.展开更多
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 schedulin...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, r j, outtree｜ ∑Cj Cj. The new algorithm is shown to be more compact and easier to implement.展开更多
基金国家高技术研究发展计划( 863)( the National High- Tech Research and Development Plan of China under Grant No.2006AA02Z499)兰州交通大学校科研基金( the Science Research Foundation of Lanzhou Jiaotong Uiversity)
文摘A kind of heap sorting method based on array sorting was proposed. Some advantages and disadvantages of it were discussed. It was compared with the traditional method of direct application. In the method, the ordered keywords in the array are put into the heap one by one after building an empty heap. This method needs relatively less space and is fit for ordered sequence.
基金This work was supported by the National Natural Science Foundation of China(No.60474023)Science and Technology Key Project Fund of theMinistry of Education(No.03184)the Major State Basic Research Development Program of China(No.2002CB312200).
文摘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, r j, outtree｜ ∑Cj Cj. The new algorithm is shown to be more compact and easier to implement.
