%0 Journal Article
%T Shuffled frog-leaping algorithm for multi-objective no-wait flowshop scheduling<br>蛙跳优化算法求解多目标无等待流水线调度
%A PAN Yu-xi
%A PAN Quan-ke
%A LI Jun-qing
%A <br>潘玉霞
%A 潘全科
%A 李俊青
%J 控制理论与应用
%D 2011
%I 
%X An enhanced shuffled frog-leaping algorithm(ESFLA) is presented based on the Pareto front and archive set for solving the no-wait flowshop scheduling problems with makespan, maximum tardiness and total flow time criteria. Firstly, an initialization method based on the NEH(Nawaz-Enscore-Ham) heuristic is designed. Secondly, a two-point crossover operator is used to produce a new individual. Thirdly, a part of the non-dominated solutions are added to the population to improve their diversity and quality. Finally, to further enhance the exploitation capability and efficiency of the algorithm, a fast local search algorithm based on the insert neighborhood is embedded in the proposed shuffled frogleaping algorithm. The computational results and comparisons show that the proposed ESFLA is effective and efficient in finding better solutions for the problem considered.
%K Pareto front
%K shuffled frog-leaping algorithm
%K no-wait flowshop scheduling
%K multi-objective
%K fast local search<br>Pareto边界
%K 蛙跳算法
%K 无等待流水线调度
%K 多目标
%K 快速局部搜索
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=970898A57DFC021F93AB51667BAED7F7&aid=1F8EB868F38CE072264C57F57B2DF767&yid=9377ED8094509821&vid=D3E34374A0D77D7F&iid=F3090AE9B60B7ED1&sid=196264D95F295743&eid=CDE3E49FCD9EE463&journal_id=1000-8152&journal_name=控制理论与应用&referenced_num=0&reference_num=8