Note: On the two-machine no-idle flowshop problem
研究了两台机器无空闲约束下的流水车间调度问题，以总完工时间为目标，指出并纠正了现有文献中的错误结论。
In this short note we study a two-machine flowshop scheduling problem with the additional no-idle feasibility constraint and the total completion time criterion function. We show that one of the few papers which deal with this special problem contains incorrect claims and suggest a way how these claims can be rectified. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47:353–358, 2000