欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
研究了目标函数是最小化最大完工时间的多处理机调度问题,此问题被证明是NP-hard问题。分析了此问题现有模拟退火算法的缺陷,在此基础上构造了一个模拟退火算法SA-LZ。大量的随机数据实验用于验证算法的性能和计算效率,实验结果表明SA-LZ算法优于现有算法。
英文摘要：
This paper considers the multiprocessor scheduling problem to minimize makespan. This problem is proved to be an NP-hard problem. The limitation of the existing simulated annealing algorithm is analyzed, and then a simulated annealing algorithm, named SA-LZ, is proposed to obtain near-optimal solutions with high quality. A large set of randomly generated instances are made to test the performance and efficiency of SA-LZ. Computational results demonstrate that the proposed algorithm is very accurate and outperforms the existing methods.
同期刊论文项目
同项目期刊论文
The group consensus based evidential reasoning approach for multiple attributive group decision anal
An attribute weight based feedback model for multiple attributive group decision analysis problems w
An argument-dependent approach to determining OWA operator weights based on the rule of maximum entr
Consumer preference prediction by using a hybrid evidential reasoning and belief rule-based methodol
Applying a belief rule-base inference methodology to a guideline-based clinical decision support sys
Integrating classification capability and reliability in associative classification: A beta-stronger
Analyzing the applicability of Dempster’s rule to the combination of interval-valued belief structur
ASSESSMENT OF STRATEGIC R&D PROJECTS FOR CAR MANUFACTURERS BASED ON THE EVIDENTIAL REASONING APPROAC
位置：