Publication at Faculty of Mathematics and Physics |

2000

A flowshop scheduling problem with the additional no-idle constraint and the total completion time criterion function is studied. We show that an earlier paper dealing with this problem contains errors and suggest how these errors can be rectified.