|
|||||
|
|
| 动态规划法求解加工顺序问题的研究 | |
| 引用本文： | 王保胜,吕聪颖,吕贯廷,马艳阳.动态规划法求解加工顺序问题的研究[J].计算机与现代化,2012(5):4-6. |
| 作者姓名： | 王保胜 吕聪颖 吕贯廷 马艳阳 |
| 作者单位： | 1. 南阳理工学院计算机科学与技术系,河南南阳,473004 2. 中国科学院北京基因组研究所,北京,100029 3. 南阳市十七中,河南南阳,473004 |
| 基金项目： | 国家自然科学基金青年科学基金资助项目 |
| 摘 要： | 提出动态规划法求解加工顺序问题的方法,分析最优子结构性质,建立最优值的递归关系式,分析Johnson-Bell-man’s Rule并设计算法流程,最后通过构造实例表明了算法的有效性。 |
| 关 键 词： | 动态规划 加工顺序 最优子结构 |
Research on Solving Processing Sequence Problem by Dynamic Programming |
|
| WANG Bao-sheng , L Cong-ying , L Guan-ting , MA Yan-yang.Research on Solving Processing Sequence Problem by Dynamic Programming[J].Computer and Modernization,2012(5):4-6. | |
| Authors: | WANG Bao-sheng L Cong-ying L Guan-ting MA Yan-yang |
| Affiliation: | WANG Bao-sheng , L(U) Cong-ying , L(U) Guan-ting , MA Yan-yang |
| Abstract: | This paper presents a dynamic programming method of solving processing sequence problem,analyzes the nature of optimal substructure,establishes the recursive expression for optimal value,analyzes the Johnson-Bellman’s Rule and designs the algorithm flow.At last,this paper identifies the effectiveness of the algorithm by constructing algorithm instance. |
| Keywords: | dynamic programming processing sequence optimal substructure |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |