We consider the problem of minimizing the sum of completion times in a two-machine permutation flowshop subject to release dates. We develop several lower bounds and we describe constructive heuristics as well as an effective genetic local search algorithm. Computational experiments carried out...