动态规划法求解加工顺序问题的研究

摘要

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.%提出动态规划法求解加工顺序问题的方法,分析最优子结构性质,建立最优值的递归关系式,分析Johnson-Bellman’s Rule并设计算法流程,最后通过构造实例表明了算法的有效性.