Solving the flexible job-shop scheduling problem by immune genetic algorithm
文献类型:会议论文
作者 | Ma J(马佳); Zhu YL(朱云龙)![]() ![]() |
出版日期 | 2010 |
会议名称 | 2010 3rd International Conference on Advanced Computer Theory and Engineering (ICACTE 2010) |
会议日期 | August 20-22, 2010 |
会议地点 | Chengdu, China |
关键词 | flexibilitye job-shop scheduling resource constrained immune genetic algorithm vaccine |
页码 | 215-218 |
中文摘要 | Analyzing the model of the flexible job-shop scheduling problem(FJSP),an immune genetic algorithm(IGA) is proposed to solve the problem. This algorithm preserves the random global search ability of simple genetic algorithm(SGA), and introduces the immune mechanism by which the necessary vaccine may be extracted with the scheduling vaccinated so as to improve efficiently SGA's low ability for global search because of immature convergence and low local search ability. Thus, the IGA proposed can provide such ability and convergence rate that will implement the global optimum solution. Experimental results showed that the IGA can solve the FJSP effectively. |
收录类别 | EI |
产权排序 | 1 |
会议录 | 2010 3rd International Conference on Advanced Computer Theory and Engineering (ICACTE 2010)
![]() |
会议录出版者 | IEEE |
会议录出版地 | Piscataway, NJ, USA |
语种 | 英语 |
ISBN号 | 978-1-4244-6539-2 |
源URL | [http://ir.sia.cn/handle/173321/8411] ![]() |
专题 | 沈阳自动化研究所_工业信息学研究室 |
推荐引用方式 GB/T 7714 | Ma J,Zhu YL,Shi G. Solving the flexible job-shop scheduling problem by immune genetic algorithm[C]. 见:2010 3rd International Conference on Advanced Computer Theory and Engineering (ICACTE 2010). Chengdu, China. August 20-22, 2010. |
入库方式: OAI收割
来源:沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。