同顺序排序问题近似最优解调优法的探讨

Study on adjusting optimization method for near optimal solution to permutation schedule problem

为了解决传统的同顺序m×n排序问题近似最优解解法优化程度不高这一问题,提出了近似最优解调优法。利用线路条数法及均衡原理在近似最优解排序方案上进行调优,通常可缩短关键线路的长度,提高优化程度,而且在多数情况非常接近最优解。该方法从图论和概率角度证明效果良好。

To improve the optimal extent in the traditional near optimal solution for m×n permutation scheduling, an adjusting optimization method is proposed. The path-number approach and balanced principles were used to make optimal adjustment and improvement on the basis of the near optimal result. This method makes the critical paths shorter and gets a higher degree of optimization. The result is highly close to optimal solution at most times. This method is effective result and can be proved by using graphic theory and probability theory.