%0 Journal Article
%T Heuristic for no-wait flow shop scheduling optimization<br>一种求解无等待流水车间调度优化的启发式算法
%A SUN Qiang-qiang
%A GAO Kai-zhou
%A DONG Bin
%A <br>孙强强
%A 高开周
%A 董　斌
%J 计算机应用研究
%D 2012
%I 
%X This paper proposed a new heuristic algorithm, named SDH heuristic, for solving the no-wait flow shop scheduling problem with the objective to minimize total flowtime. The SDH heuristic was based on the well-known NEH heuristic. Firstly, elaborated the total flowtime. Secondly, it presented the SDH heuristic. It carried out extensive computational experiments based on a set of well-known benchmark instances at last. Computational results and comparison show the effectiveness of the SDH heuristic in solving the no-wait flow shop scheduling with total flowtime criterion.
%K no-wait
%K flow shop scheduling
%K total flowtime
%K SDH heuristic<br>无等待
%K 流水车间调度
%K 总流水时间
%K 标准差启发
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=AB480754FB5F26FE21DDC0741AC98C84&yid=99E9153A83D4CB11&vid=771469D9D58C34FF&iid=B31275AF3241DB2D&sid=414605CF9628FD51&eid=CFC6DB3515228A5D&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=15