Moreover, we consider the minimal total completion time problem where there is not the idle time in machine M1, and derive the optimality conditions for this kind of flowshops scheduling problems.

• 本文以总完工时间为准则研究调整时间和移走时间均独立于加工时间的两机器流水作业问题，给出了问题最优解中工件排列应满足的条件；