摘要
提出动态规划法求解加工顺序问题的方法,分析最优子结构性质,建立最优值的递归关系式,分析Johnson-Bell-man’s Rule并设计算法流程,最后通过构造实例表明了算法的有效性。
This paper presents a dynamic programming method of solving processing sequence problem, analyzes the nature of optimal substructure, establishes the recursive expression for opti .mal 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.
出处
《计算机与现代化》
2012年第5期4-6,共3页
Computer and Modernization
基金
国家自然科学基金青年科学基金资助项目(81101490)
关键词
动态规划
加工顺序
最优子结构
dynamic programming
processing sequence
optimal substructure
