An Application of Immune Genetic Algorithm for Flexible Job-shop Scheduling Problem
The flexible job-shop scheduling problem(FJSP) is one of the most general and difficult of all traditional scheduling problem.,The paper presents a novelty immune genetic algorithmic A) 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 SGAs 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. The computation results validate the effectiveness of the proposed algorithm.
flexible job-shop scheduling problem scheduling immune genetic algorithm immune operator abstract vaccin
Jia Ma Yunlong Zhu Jia Ma Tianran Wang
School of Economic and Management Shenyang Institute of Aeronautical Engineerin Shenyang, china Shenyang Institute of Automation Chinese Academy of Sciences Shenyang, China
国际会议
太原
英文
461-464
2010-10-22（万方平台首次上网日期，不代表论文的发表时间）