In this paper we face the permutation flow-shop scheduling problem with a makespan objective function in two variants, with and without storage space between machines. We use an improved branch and bound algorithm, suitable ...