摘要
提出了一种解决车间调度最短完成时间的有效的混合算法。将遗传算法与蚂蚁算法的融合,采用遗传算法生成信息素分布,利用蚂蚁算法求精确解,优势互补。应用该算法对Job-Shop车间作业调度问题的解进行编译,通过实例表明该算法是可行有效的。
An effective mixed algorithm for solving the minimum makespan problem of Job-Shop scheduling is presented. An optimal scheduling algorithm that combines ACA （Ant Colony Algorithm）with GA （Genetic Algorithm） is put forward. It adopts genetic algorithm to give information pheromone to distribute, use ant colony algorithm to get accurate solution and make the advantages of relevant departments complementary with each other. Simulation results demonstrate that the mixed algorithm is applicable and effective.
出处
《科学技术与工程》
2009年第11期3109-3112,共4页
Science Technology and Engineering
基金
国家自然科学基金(70572098)资助
关键词
作业车间调度
蚂蚁算法
遗传算法
Job-Shop scheduling ant colony algorithm genetic algorithm
