| 柔性Flow shop加权完成时间调度问题的启发式算法 |
| |
| 引用本文： | 古春生,陈华平,卢冰原,谷峰. 柔性Flow shop加权完成时间调度问题的启发式算法[J]. 系统管理学报, 2006, 15(2): 139-144 |
| |
| 作者姓名： | 古春生 陈华平 卢冰原 谷峰 |
| |
| 作者单位： | 中国科学技术大学,商学院,合肥,230052 |
| |
| 基金项目： | 安徽省自然科学基金;中国科技大学校科研和教改项目 |
| |
| 摘 要： | 使用单机松弛方法证明了,即使对于柔性F low shop加权完成时间调度问题,基于加权最短处理时间需求的启发式算法也是渐近最优的。
|
| 关 键 词： | 柔性Flowshop调度 启发式算法 渐近最优分析 |
| 文章编号： | 1005-2542(2006)02-0139-06 |
| 修稿时间： | 2005-03-02 |
Analysis of Heuristic Algorithm for the Flexible Flow Shop Weighted Completion Time Scheduling Problem |
| |
| GU Chun-sheng,CHEN Hua-ping,LU Bing-yuan,GU Feng. Analysis of Heuristic Algorithm for the Flexible Flow Shop Weighted Completion Time Scheduling Problem[J]. Systems Engineering Theory·Methodology·Applications, 2006, 15(2): 139-144 |
| |
| Authors: | GU Chun-sheng CHEN Hua-ping LU Bing-yuan GU Feng |
| |
| Abstract: | By using single machine relaxation,we have proved that,even for the flexible Flow shop weighted completion time scheduling problem,the heuristic based on weighted shortest processing requirement is also asymptotically optimal in this paper. |
| |
| Keywords: | flexible Flow shop scheduling heuristic algorithm asymptotically optimal analysis |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
