%0 Journal Article
%T Nested partition-optimization algorithm for flow shop scheduling<br>Flow shop问题的嵌套分区优化调度方法
%A WU Wei
%A GUAN Xiao-hong
%A WEI Jun-hu
%A <br>武 维
%A 管晓宏
%A 卫军胡
%J 控制理论与应用
%D 2009
%I 
%X A nested partition-algorithm and its application to the flow shop scheduling problem are addressed in this paper. In this application, the flow shop scheduling problem is considered as a partition tree. The algorithm performs an iterative process in which it partitions the feasible region and searches for the subset where the optimal solution is located. In the iteration, a heuristic algorithm and a neighborhood-search are employed to select a sample-point for estimating the promising index for each subset. Finally, computational experiments indicate that the algorithm outperforms the constructive heuristic algorithm and neighborhood-search in the performance of searching.
%K nested partition-algorithm
%K flow shop scheduling
%K optimization scheduling
%K heuristic algorithm<br>嵌套分区算法
%K 流水作业调度
%K 优化调度
%K 启发式算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=970898A57DFC021F93AB51667BAED7F7&aid=843A3B6C61391888687789B42F9FCD41&yid=DE12191FBD62783C&vid=96C778EE049EE47D&iid=38B194292C032A66&sid=FD7C952458BFB5D8&eid=FE4C96E058BB2280&journal_id=1000-8152&journal_name=控制理论与应用&referenced_num=0&reference_num=12