【摘要】 本文主要给出了同顺序ｍ×ｎ排序问题初始序的选取方法以及通过计算可避免出现高重循环的初始序的排序算法，然后又给出了利用矩阵可行线性质将初始序调试成较优序的可行方法．利用该文方法对ｎ＝１５，ｍ＝ ３～１４的１４４个例题计算，得出平均相对误差为 ３．１４５％的结果，对于ｍ＝ ３与ｍ＝ ４的 １２８个例题计算，得出平均相对误差为 ０．６３０６％．统计结果表明该方法可在实际中进行应用．更多还原

【Abstract】 This paper present a new heurstic algorithm for m × n Flow-Shop scheduling problem. In this algorithm, there is no mutiple cycle for an initial sequence. We give also a method which can change the initial sequence to a better one by using the characters of the feasible line of the matrix. Examples with n = 15, m = 3 - 14 show that the relativ error in average is 3.145%. And examples with n = 15, m = 3 and m = 14 show that the relative error in average is 0.63%. Statistic results show that this method can be applied effectively in practice.更多还原