In this article, we consider flowshop scheduling problems with time lag constraints to minimize the weighted sum of machine completion times as objective function. Although this criterion has been addressed in few papers, it may be extremely important in practical situations. We present several complexity results for two- and three-machine problems and propose a branch and bound method to solve the m-machine case.