Ant-colony heuristic algorithm for no-idle flow shop scheduling problem
求解零空闲流水线调度问题的改进蚁群算法*

On based of studying ant-colony heuristic algorithm, solved the No-idle Flow Shop with minimizing the makespan criterion. Improved ant colony algorithm of initialization pheromone density and updated rules, combined with rapid neighborhood search algorithm, solving algorithm into the local convergence of the algorithm is proposed to solve the optimal scheduling problem of zero free solution strategy. Simulation experiments show that the algorithm is effective and superiority.