Flowshop/no-idle scheduling to minimise the mean flowtime

This paper deals with n-job, 2-machine flowshop/mean flowtime scheduling problems working under a no-idle constraint, that is, when machines work continuously without idle intervals. A branch and bound technique has been developed to solve the problem.