A Genetic Algorithm To Minimize The Total Of Tardiness Multiprocessing Tasks On Two Dedicated Processors

2017 4TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT)（2017）

引用 3|浏览8

暂无评分

摘要

in this work, we study the problem of scheduling multiprocessor tasks on two dedicated processors with release date. Our objective is to minimize the sum of the tasks tardiness. This NP-hard problem in the strong sense requires the use of well-adapted methods. Thus, to solve this problem, a genetic algorithm was designed and a lower bound was constructed to evaluate the experimental results.

查看译文

关键词

scheduling, total of tardiness, tasks, dedicated processors, genetic algorithms, lower bound

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要