%0 Journal Article
%T Ant-colony heuristic algorithm for no-idle flow shop scheduling problem<br>求解零空闲流水线调度问题的改进蚁群算法*
%A ZHANG Feng-rong
%A DUAN Jun-hua
%A PANG Rong-bo
%A HAN Hong-yanb
%A <br>张风荣
%A 段俊华
%A 庞荣波
%A 韩红燕b
%J 计算机应用研究
%D 2011
%I 
%X 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.
%K Ant colony optimization
%K no-idle flow shop scheduling
%K makespan
%K local search<br>蚁群算法
%K 零空闲流水线调度
%K 最大完工时间
%K 邻域搜索
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=32196FFEBAEA372A253FB69AD88380CB&yid=9377ED8094509821&vid=D3E34374A0D77D7F&iid=38B194292C032A66&sid=EE7D0B10C851F35D&eid=0B757E9DCA0EC579&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=17