N项作业的双机排序问题，已经有非常成熟的理论求解方法，即Johnson算法，可以找到最优解。(There is a very mature method of solving the double machine scheduling problem in N item, that is, Johnson algorithm, and the optimal solution can be found.)