1/r,p_j≡1/L_(max)在应交工时间可控时有效点集的求解

The Construction of the Efficient Points Set for 1/r,p j≡1/L max with Controllable Due Dates

对应交工时间可控时的排序问题１／ｒ，ｐｊ≡１／Ｌｍａｘ，以Ｆ１表示Ｌｍａｘ，Ｆ２表示应交工时间滞后和，Ｆ１、Ｆ２同时极小化。

This paper considers the machine sequencing problem 1/ r,p j≡1/L max with controllable due dates.Taking L max as F 1 and the total delaies of due dates as F 2,for the minimizing the F 1 and F 2 simultaneously,the paper constructs a pseudopolynomial time algorithm for finding out its efficient point set.