The distributed permutation flow shop to minimise the total flowtime.

•We address the distributed permutation flow shop for total flowtime.•We propose eighteen constructive heuristics to efficiently solve the problem.•We propose a simple evolutionary algorithm for the problem.•We present several properties and assignment rules for the problem.•We compare the proposal with efficient algorithms in the literature.