同顺序排序问题近似最优解的一种简便解法

为了解决传统的同顺序m×n排序问题近似最优解解法优化程度不高且步骤繁琐这一问题,提出一种新的近似最优解简便解法.该方法在分析最小系数法、关键零件法和关键加工中心法利弊的基础上,兼顾3种方法的优点,克服三者缺点,综合提出了优化程度更高的简便解法,并从图论、概率论及仿真试验角度证明,该方法使用效果良好.

The New Simple Method for Approximate Optimalsolution of Permutation Schedule Problem

To improve the optimal extent and to reduce the steps of solution in the traditional approximate optimal solution for permutation scheduling ,the simple method was proposed .The method anlyses the advantages and disadvan‐tages of minimum coefficient method ;key component meth‐od;the disadvantages of those methods .This method makes the critical paths shorter and gets a higher degree of optimi‐zation .The result is highly close to optimal solution at most time .This method has good result and can be proved by u‐sing Graphic theory and Probability theory .