We consider the permutation flow shop scheduling problem, with release dates and due dates. There are n machines and m jobs, and each job contains exactly n operations.