结果表明：在工件的权重和工件的平均加工时间不成比例的最一般的情况下，最短加工时间和最长加工时间优先规则的联合使用给出了使拖后工件数最少的优先策略，并对算法的最优性进行了证明。
The priority policy of joint use of the shortest expected processing time and the longest prcessing time is optimal when the expected processing time is non-proportional to the number of the jobs.
结果表明：在工件的权重和工件的平均加工时间不成比例的最一般的情况下，最短加工时间和最长加工时间优先规则的联合使用给出了使拖后工件数最少的优先策略，并对算法的最优性进行了证明。
The priority policy of joint use of the shortest expected processing time and the longest prcessing time is optimal when the expected processing time is non-proportional to the number of the jobs.
应用推荐