| 任务分配与调度中的遗传算法：知识表示与遗传算法子研究 |
| |
| 引用本文： | 钟求喜,谢涛.任务分配与调度中的遗传算法：知识表示与遗传算法子研究[J].计算机科学,2000,27(6):46-49. |
| |
| 作者姓名： | 钟求喜 谢涛 |
| |
| 作者单位： | 钟求喜（国防科技大学计算机学院 长沙 410073）;谢涛（国防科技大学计算机学院 长沙 410073）;陈火旺（国防科技大学计算机学院 长沙 410073） |
| |
| 基金项目： | 国家自然科学基金(No:69903010) |
| |
| 摘 要： | Task matching and scheduling play an important role in parallel and distributed systems.In order to use genetic algorithms(Gas) for tasks matching and scheduling,not only appropriate representations of solutions but also genetic operators’efficiency and generality are very important.In this paper,analysis between problem space and representation space is given at the first.Then based on the representation of permutation,two general efficient genetic operators are proposed,order crossover(OCX)and migration. OCX generates new schedules with heuristic due to the problem space with constraints among tasks. Migration transfers a task from one processor to another within a schedule. The simulation results of algorithms and conclusions are given at last.
|
| 关 键 词： | 任务分配 调度 遗传算法 知识表示 遗传算子 |
Representation and Genetic Operators in Tasks Matching & Scheduling by Genetic Algorithms |
| |
| Abstract: | |
| |
| Keywords: | Tasks matching & scheduling Genetic algorithms Order crossover Migration |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
点击此处可从《计算机科学》下载全文 |
