引用本文:陈华平,古春生.随机柔性Flow shop加权完成时间调度问题的启发式策略性能分析[J].控制理论与应用,2006,23(4):523~525.[点击复制]
CHEN Hua-ping, GU Chun-sheng .Performance analysis of policy of heuristic for the stochastic flexible flow shop weighted completion time scheduling problem[J].Control Theory and Technology,2006,23(4):523~525.[点击复制]
随机柔性Flow shop加权完成时间调度问题的启发式策略性能分析
Performance analysis of policy of heuristic for the stochastic flexible flow shop weighted completion time scheduling problem
摘要点击 1389  全文点击 849  投稿时间：2004-12-16  修订日期：2005-09-22
查看全文  查看/发表评论  下载PDF阅读器
DOI编号  10.7641/j.issn.1000-8152.2006.4.005
  2006,23(4):523-525
中文关键词  调度  随机柔性Flow shop  启发式策略  渐近最优
英文关键词  scheduling  stochastic flexible Flow shop scheduling  policy of heuristic  asymptotic optimal
基金项目  安徽省自然科学基金资助项目(050460404); 中国科学技术大学研究生创新基金资助项目(KD2004056)
作者单位
陈华平,古春生 中国科学技术大学 信息管理与决策科学系,安徽 合肥230052
江苏技术师范学院 计算机科学与工程学院,江苏 常州213001 
中文摘要
      因实际生产中调度问题的规模很大,分析其近似算法的绝对性能比很难,有时甚至不可能,所以研究近似算法的渐近性能比就很有必要．本文针对随机柔性Flow shop加权完成时间调度问题,使用单机松弛和概率分析方法,证明了基于加权最短期望处理时间需求的启发式策略是渐近最优的．
英文摘要
      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.