| 一种求解带资源约束的并行机器多目标调度问题的遗传算法 |
| |
| 引用本文： | 曾相戈,韩伯棠.一种求解带资源约束的并行机器多目标调度问题的遗传算法[J].系统工程理论与实践,2005,25(9):78-82. |
| |
| 作者姓名： | 曾相戈 韩伯棠 |
| |
| 作者单位： | 北京理工大学管理与经济学院,北京,100081 |
| |
| 摘 要： | 探讨了双目标下,带一种资源约束的,工件成类别的并行机器调度问题.针对该问题,提出了一种遗传算法.该算法采用了两两竞赛的选择算子、聚集度、违约度来处理多目标约束优化.通过随机订单的测试,计算结果显示:对于各个单目标值,该算法比修正的EDD、LPT、SPT能改善3%~37%.
|
| 关 键 词： | 多目标 约束 并行机器 遗传算法 |
| 文章编号： | 1000-6788(2005)09-0078-05 |
| 修稿时间： | 2004年9月2日 |
Using Genetic Algorithms for Parallel Machines Multi-Objective Scheduling Problems with Families and One Resource Constrained |
| |
| ZENG Xiang-ge,HAN Bo-tang.Using Genetic Algorithms for Parallel Machines Multi-Objective Scheduling Problems with Families and One Resource Constrained[J].Systems Engineering —Theory & Practice,2005,25(9):78-82. |
| |
| Authors: | ZENG Xiang-ge HAN Bo-tang |
| |
| Abstract: | Multi-objective scheduling on parallel machines with families and one resource constrained is considered. The objectives are total tardiness and maximum make-span. This paper proposes genetic algorithms using tournament selection, niche count, and violation degree to solve this problem. The computational results from random orders show that the genetic algorithms are more efficient than rectified EDD,LPT, and SPT in solving the problem. |
| |
| Keywords: | multi-objective constraint parallel machines genetic algorithms |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《系统工程理论与实践》浏览原始摘要信息 |
| 点击此处可从《系统工程理论与实践》下载免费的PDF全文 |
