基于蚁群优化的置换流水车间调度算法

针对置换流水车间调度问题,提出了一种基于蚁群优化的调度算法.该算法的要点是将NEH启发式算法和蚁群优化结合起来:首先,将蚁群优化中的能见度定义为NEH中所用的工作加工时间之和.其次,对于部分解采用了NEH中的步骤2和步骤3进行局部调整.最后,对构造出的解做插入型局部搜索.用所提算法对置换流水车间调度问题的基准问题进行了测试,测试结果表明提出算法的有效性.

Ant colony optimization based algorithm for permutation flow shop scheduling

To solve the permutation flow-shop scheduling problem,an ant colony optimization based algorithm is proposed.The key point of the algorithm is to integrate Nawaz-Enscore-Ham heuristic with ant colony optimization: first,the visibility of ant colony optimization is defined as the job's sum of processing times of the NEH,second,the partial solutions are adjusted through the step 2 and step 3 of NEH.Finally,the insert local search is applied to the constructed solutions.The proposed algorithm is tested on scheduling problem benchmarks.Experimental results show its efficiency.