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...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,processing time and delivery time first rule is designed to determine a certain machine for each job,and the largest difference between delivery time and release date first rule is designed to sequence the jobs scheduled on the same machine,and then a novel algorithm for the scheduling problem is built.To evaluate the performance of the proposed algorithm,a lower bound for the problem is proposed.The accuracy of the proposed algorithm is tested based on the data with problem size varying from 200 jobs to 600 jobs.The computational results indicate that the average relative error between the proposed algorithm and the lower bound is only 0.667%,therefore the solutions obtained by the proposed algorithm are very accurate.展开更多
针对传统依赖精确位置信息的计算复杂和无位置信息部署受限性等弊端,从理论上对节点部署方式进行分析,提出一种非均匀分布下的无线传感器网络节点调度NDNS(non-uniform distribution node scheduling)机制,该机制利用节点与邻居节点的...针对传统依赖精确位置信息的计算复杂和无位置信息部署受限性等弊端,从理论上对节点部署方式进行分析,提出一种非均匀分布下的无线传感器网络节点调度NDNS(non-uniform distribution node scheduling)机制,该机制利用节点与邻居节点的距离信息,对节点覆盖冗余进行判别,适应于任意分布下的网络部署方式。通过实验对机制进行了性能分析和验证,结果表明该方案在保证网络覆盖的前提下,有效地延长了网络生存时间。展开更多
基金supported by the National Natural Science Foundation of China (7087103290924021+2 种基金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,processing time and delivery time first rule is designed to determine a certain machine for each job,and the largest difference between delivery time and release date first rule is designed to sequence the jobs scheduled on the same machine,and then a novel algorithm for the scheduling problem is built.To evaluate the performance of the proposed algorithm,a lower bound for the problem is proposed.The accuracy of the proposed algorithm is tested based on the data with problem size varying from 200 jobs to 600 jobs.The computational results indicate that the average relative error between the proposed algorithm and the lower bound is only 0.667%,therefore the solutions obtained by the proposed algorithm are very accurate.
文摘针对传统依赖精确位置信息的计算复杂和无位置信息部署受限性等弊端,从理论上对节点部署方式进行分析,提出一种非均匀分布下的无线传感器网络节点调度NDNS(non-uniform distribution node scheduling)机制,该机制利用节点与邻居节点的距离信息,对节点覆盖冗余进行判别,适应于任意分布下的网络部署方式。通过实验对机制进行了性能分析和验证,结果表明该方案在保证网络覆盖的前提下,有效地延长了网络生存时间。
