计算机工程2012，Vol.38Issue(19)：137-141,5.DOI:10.3969/j.issn.1000-3428.2012.19.036
两阶段流水车间批调度问题的蚁群优化算法
Ant Colony Optimization Algorithm for Batch Scheduling Problem of Two-stage Flow Shop
摘要
Abstract
This paper proposes an Ant Colony Optimization(ACO) approach to minimize the makespan in a two-stage flow shop with two batch processing machines and non-identical job sizes. Based on the similarities (measured by standard deviation) of job processing time in every stage, heuristic information is suggested to improve the level of similarities of jobs in the same batch. Simultaneously, for better performance, an improved encoding scheme of ACO and a local search algorithm are presented. Experimental results show that ACO has better effectiveness than other approaches, especially for the cases with large job number.关键词
流水车间/批处理机/调度/蚁群优化算法/组合优化/启发式Key words
flow shop/ batch processing machine/ scheduling/ Ant Colony Optimization(ACO) algorithm/ combinatorial optimization/ heuristic分类
信息技术与安全科学引用本文复制引用
陈成栋,陈华平,朱颀,李小林..两阶段流水车间批调度问题的蚁群优化算法[J].计算机工程,2012,38(19):137-141,5.基金项目
国家自然科学基金资助项目(70821001,71171184) （70821001,71171184）
