Minimization of maximum lateness in an m-machine permutation flow shop with a general exponential learning effect

To form a hybrid solution framework, several heuristics, a branch-and-bound algorithm and a new Nested-Partition-based solution approach are proposed to reduce the searching region and to provide guidance on the lower bound.