%0 Journal Article
%T Performance analysis of policy of heuristic for the stochastic flexible flow shop weighted completion time scheduling problem<br>随机柔性Flow shop加权完成时间调度问题的启发式策略性能分析
%A CHEN Hua-ping
%A GU Chun-sheng
%A <br>陈华平
%A 古春生
%J 控制理论与应用
%D 2006
%I 
%X Due to the large size of scheduling problem in reality, it is more difficult, sometimes impossible, to analyze the absolute performance ratio of its approximation algorithm. It is thus necessary to study the asymptotical performance ratio of approximation algorithm for scheduling problem. By using single machine relaxation and probabilistic analysis, this paper proves that the policy of heuristic based on weighted shortest expected processing requirement is asymptotically optimal for the stochastic flexible flow shop weighted completion time scheduling problem.
%K scheduling
%K stochastic flexible Flow shop scheduling
%K policy of heuristic
%K asymptotic optimal<br>调度
%K 随机柔性Flow
%K shop
%K 启发式策略
%K 渐近最优
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=970898A57DFC021F93AB51667BAED7F7&aid=B5E7284A8F58B275&yid=37904DC365DD7266&vid=EA389574707BDED3&iid=E158A972A605785F&sid=C81D738643975BB0&eid=20C3B205768D55E0&journal_id=1000-8152&journal_name=控制理论与应用&referenced_num=1&reference_num=6