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

一种有效的启发式Flowshop调度算法
引用本文:刘东坡,顾幸生.一种有效的启发式Flowshop调度算法[J].华东理工大学学报(自然科学版),2002(Z1).
作者姓名:刘东坡  顾幸生
作者单位:华东理工大学自动化研究所 上海200237 (刘东坡),华东理工大学自动化研究所 上海200237(顾幸生)
基金项目:国家自然科学基金项目 (698740 12 ),国家高技术研究发展计划专项经费资助项目
摘    要:通过引入完工时间下限和优先权 ,Rajendran提出的启发式算法取得了良好的计算效果。本文对该算法进行了有效的改进 ,所提出的算法充分考虑了各种调度排序影响因素 ,将它们作为调度因子有机组合起来 ,添加到新提出的调度算法中。实验数据表明 ,新算法具有良好的计算效果 ,调度算法在高阶 weighted flowtime减少 2 .71 %左右。

关 键 词:调度  flowshop  flowtime  加权

An Efficient Heuristics Algorithm in Flowshop Scheduling
LIU Dong po,GU Xing sheng.An Efficient Heuristics Algorithm in Flowshop Scheduling[J].Journal of East China University of Science and Technology,2002(Z1).
Authors:LIU Dong po  GU Xing sheng
Institution:LIU Dong po,GU Xing sheng *
Abstract:In this paper a new heuristic algorithm is presented by setting the minimal weighted flowtime as the goal of flowshop scheduling. The new algorithm is developed by the introduction of lower bounds on completion times of jobs and the development of heuristic preference relation for the scheduling problem is under study. Incorporated with some new consideration to enhance the performance of the former literature's algorithm, the new algorithm is tested by many sets of data and the statistical outcome shows that the new algorithm is superior to that of the literature. It is observed that generally the new algorithm gives a superior solution and about 2.71% improvement in both makespan and weighted flowtime.
Keywords:scheduling  flowshop  flowtime  weight
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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