中文摘要：

研究两个单机排序问题。目标函数均是最大加权完工时间。对于问题I｜｜maxw,c，证明了LW规则序是最优排序，而问题1｜r,｜maxw,cj．用3-划分问题归结。证明是强NP困难的。

英文摘要：

This paper studies two single machine scheduling problem. The objective function is the maximum weighted completion time. For the 1 ｜｜ maxzvjcj, we prove that the I.W rule is the best order. For the l｜rj｜maxwjcj, it is proved to be stongiy NP-hard by the 3 partition problem.