首页 | 本学科首页   官方微博 | 高级检索  
     

随机柔性Flow shop加权完成时间调度问题的启发式策略性能分析
引用本文:陈华平,古春生. 随机柔性Flow shop加权完成时间调度问题的启发式策略性能分析[J]. 控制理论与应用, 2006, 23(4): 523-525
作者姓名:陈华平  古春生
作者单位:中国科学技术大学,信息管理与决策科学系,安徽,合肥,230052;中国科学技术大学,信息管理与决策科学系,安徽,合肥,230052;江苏技术师范学院,计算机科学与工程学院,江苏,常州,213001
基金项目:安徽省自然科学基金资助项目(050460404); 中国科学技术大学研究生创新基金资助项目(KD2004056)
摘    要:因实际生产中调度问题的规模很大,分析其近似算法的绝对性能比很难,有时甚至不可能,所以研究近似算法的渐近性能比就很有必要.本文针对随机柔性Flow shop加权完成时间调度问题,使用单机松弛和概率分析方法,证明了基于加权最短期望处理时间需求的启发式策略是渐近最优的.

关 键 词:调度  随机柔性Flow shop  启发式策略  渐近最优
文章编号:1000-8152(2006)04-0523-03
收稿时间:2004-12-16
修稿时间:2004-12-162005-09-22

Performance analysis of policy of heuristic for the stochastic flexible flow shop weighted completion time scheduling problem
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 & Applications, 2006, 23(4): 523-525
Authors:CHEN Hua-ping  GU Chun-sheng
Affiliation:Department of Information Management and Decision Science, University of Science and Technology of China, Hefei Anhui 230052, China; School of Computer Science and Engineering, Jiangsu Teachers University of Technology, Changzhou Jiangsu 213001, China
Abstract: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.
Keywords:scheduling  stochastic flexible Flow shop scheduling  policy of heuristic  asymptotic optimal  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《控制理论与应用》浏览原始摘要信息
点击此处可从《控制理论与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号