首页 | 本学科首页   官方微博 | 高级检索  
     

解Job-shop调度问题的自适应遗传方法
引用本文:顾擎明,曹丽娟,宋文忠.解Job-shop调度问题的自适应遗传方法[J].控制与决策,1998,13(5):589-593.
作者姓名:顾擎明  曹丽娟  宋文忠
作者单位:东南大学自动化研究所,东南大学
摘    要:研究Job-shop调度问题。首先分析遗传算法的参数值优化问题,然后结合遗传算法和调度的特性,构造解Job-shop调度问题的自适应遗传方法,最后针对几个典型调度问题提出解决方案。仿真实验表明了此法用于复杂调度问题的优越性。

关 键 词:调度,遗传算法,参数优化

Adaptive Genetic Algorithm of Solving Job-shop Scheduling Problem
Gu Qingming,Cao Lijuan,Song Wenzhong.Adaptive Genetic Algorithm of Solving Job-shop Scheduling Problem[J].Control and Decision,1998,13(5):589-593.
Authors:Gu Qingming  Cao Lijuan  Song Wenzhong
Affiliation:Southeast Uniersity
Abstract:The method for Job-shop scheduling problem is studied in this paper. First, parameter optimizations of genetic algorithm are analyzed. Then, combining with the features of scheduling, adaptive Genetic Algorithm(AGA) is constructed. Finally, three typical scheduling problems are solved by AGA. The simulation results show that the method above is good in complex scheduling.
Keywords:scheduling  genetic algorithm  parameter optimization  
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号