An ant-colony heuristic algorithm was proposed for the No-Wait Flow Shop problem(NWFS) with makespan criterion.

• 针对以最大完成时间为目标的无等待流水车间调度问题,提出了一种蚁群算法。