【摘要】 同顺序m×n排序问题通常是求极小最大流程时间,而且近似最优解解法比较多。这里首次提出了求极大最大流程时间的解法及其经济含义。在甲乙双方的对抗和竞争中,甲方无疑追求完成某项工程时间最小,即求极小最大流程时间;而希望乙方完成某项工程时间最长,即求极大最大流程时间。因此有必要研究求极大最大流程时间问题。极大值解法不仅给出了非常满意的近似最优解解法,而且在多数情况下通过简单的调优比较容易得到最优解。更多还原

【Abstract】 There are many near optimal methods for solving m×n permutation schedule problems and in general that is to get minimum maximum flow time.Here the methods of maximum maximal flow time and its economic meaning are mentioned for the first time.In confrontation and competition between Party A and Party B,no doubt,the goal of Party A is to accomplish a project using minimum time,that is minimum maximal flow time;while hoping the opponent to use the maximum time,that is maximum maximal flow time.So it is necessary to study the maximum maximal flow time problem.The methods of maximum of maximal flow time not only give near optimal result satisfactorily,but also in most cases get the optimal result.更多还原