A new lower bounding rule for permutation flow shop scheduling

Abstract

This paper applies branch-and-bound technique to the permutation flow shop scheduling where the objective is to minimize makespan. A new lower bound of the branch-and-bound algorithm is presented. It shows that the new lower bound of the branch-and-bound algorithm is theoretically and empirically preferred.