Elimination conditions and lower bounds for the permutation flow-shop sequencing problem
We give some new elimination conditions for permutation flow-shop problems and prove that there is one among them equivalent to Szwarc's elimination condition. Next we propose some new lower bounds for a branch-and-bound method and design an algorithm. Computational results indicate that the proposed algorithm is more efficient than those we found in the literature.
scientific article; zbMATH DE number 4018753