双目标优化排序问题1/r_j,UET/L_(max)∩C_(max)

Bi criteria Scheduling Problem 1/ r j , UET/L max ∩ C max

本文首先证明排序问题１／ｒｊ／Ｃｍａｘ的“随手加工”法则，然后在此基础上对１／ｒｊ，ＵＥＴ／Ｌｍａｘ∩Ｃｍａｘ给出一个多项式最优化算法．

Abstract In this paper we first prove a new scheduling rule for the problem 1/ r j/C max , and then propose a polynomial optimal algorithm for the bi criteria scheduling problem 1/ r j, UET/L max ∩ C max .