A new polynomial algorithm for a parallel identical scheduling problem
Yumei LI
Hongxing LI
Vincent C.YEN
摘要：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,Tj,outtree|∑ Cj.The new algorithm is shown to be more compact and easier to implement.
机标关键词：scheduling problempolynomial algorithmnew algorithm
分类号：TP3(计算技术、计算机技术)
资助基金：国家自然科学基金(60474023)Science and Technology Key Project Fund of the Ministry of Education(03184)国家重点基础研究发展计划(973计划)(2002CB312200)
论文发表日期：2007-01-01
在线出版日期：2025-08-15（本平台首次上网日期，不代表文献的发表时间）
页数：6( 345-350 )
英文信息