We propose an exact branch-and-bound algorithm for the problem of maximizing the minimum machine completion time on identical
parallel machines. The proposed algorithm is based on tight lower and upper bounds as well as an effective symmetry-breaking
branching strategy. Computational results performed on a large set of randomly generated instances attest to the efficacy
of the proposed algorithm.
Keywords Scheduling - Identical parallel machines - Branch-and-bound
MSC classification 90B35