【摘要】 讨论转盘上的流水作业问题，其中每个加工工件从一个工序到下一个工序需要用此转盘来运输，而且从入口到第一个加工机器和从最后一个加工机器返回工件入口，也要用此转盘来运输．在本文中，我们证明，即使只有一台加工机器，带有转盘的流水作业的加工全长问题也是强ＮＰ困难的．更多还原

【Abstract】 This paper deals with the makespan problem of flow shops with a transportation turntable,which is used for moving the jobs from any machine to the next machine,for moving the jobs from the entrance to the first machine,and for moving the jobs from the last machine to the entrance back as well.It is proved that the problem is strangly NP hard even if there is only one machine for processing. The result is obtained by using a reduction from the 3 Partition problem.更多还原