%0 Journal Article
%T Research on MFJSSP based on improved ant colony algorithm<br>基于改进型蚁群算法的MFJSSP研究*
%A LI Li
%A WANG Ke-qib
%A <br>李莉
%A 王克奇b
%J 计算机应用研究
%D 2011
%I 
%X To optimize MFJSSP, this paper presented an improved method based on ant colony algorithm. In the approved algorithm, defined subsets number according to jobs number. Discribed the method of constructing allowing set. Used an effective local search method for a better scheduling. Discussed the problem of choosing suitable parameters in ant colony algorithm. Improved the ant colony algorithm for MFJSSP. Applied the improved ant colony algorithm in the problem of 4×5 and problem 8×8. It achieved satisfactory results. The obtained results indicate that the proposed approach is feasible and effective for MFJSSP.
%K multi-objective optimization
%K flexible job shop schedule
%K ant colony algorithm<br>多目标优化
%K 柔性作业车间调度
%K 蚁群算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=96AD031A5332F29F14175882E7297EE1&yid=9377ED8094509821&vid=D3E34374A0D77D7F&iid=94C357A881DFC066&sid=FFC2683A1E8523F1&eid=ADEE3E9286A455E3&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=13