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 thi
s special problem contains incorrect claims and suggest a way how these cla
ims can be rectified. (C) 2000 John Wiley & Sons, Inc.