基于蚁群算法的多功能机床环境下混杂流水作业计划

Scheduling Method for HFSP-MFM with Ant Colony Optimization

针对工件在平行机上具有不同加工时间的多功能机床(MFM)环境下混杂流水作业问题(HFSP-MFM),用非连接图模型对其进行建模,提出一种基于蚁群算法的单层算法和三种两层算法对该问题进行求解。将最大规模为75×20的多个标准算例的数据应用于HFSP-MFM问题,通过算例研究,对比分析了所提出的单层算法和两层算法的寻优性能,结果表明,对于HFSP-MFM问题,单层算法具有更好的优化效果。

Scheduling problem of hybrid flow shop in the environment of multi--functional machines （HFSP--MFM） was put forward where the processing time of jobs on parallel machines may be different. The disjunctive graph was used for its modeling. A one--level algorithm employing ant colony optimization （ACO） and other three two--level algorithms were proposed for the HFSP-- MFM. These algorithms were employed to the numerical experiments making use of the data of several benchmark instances that the scale was up to 75×20. The results show that the one--level algorithm has better performance than that of the two--level algorithms for the studied problems.