Research of an improved Genetic Algorithm for Job Shop Scheduling

摘要：

Job shop scheduling is one of the most difficult NP hard combinatorial optimize problems, in order to solve this problem, an improved Genetic Algorithm with threedimensional coded model was put forward in this paper. In this model, the gene was coded with 3-D space, and selfadapting plot was drawn into conventional GA, then the probability of crossover and mutation can automatic adjust by fit degree. The instance shows that this algorithmic is effective to solve job shop scheduling problem.

关键词： job shop scheduling Genetic Algorithm threedimensional coded model self-adapting formatting

作者: Wu Jinghua Chen Mianzhou

作者单位: Huangshi Institute of Technology Huangshi, China

会议类型: 国际会议

会议名称: 2010 International Conference on Measuring Technology and Mechatronics Automation(ICMTMA 2010)(2010年检测技术与机电自动化国际会议)

会议地点: 长沙

会议语种:英文

页码: 2201-2203

在线出版日期: 2010-03-13（万方平台首次上网日期，不代表论文的发表时间）