Recursive refinement of lower bounds in the multiprocessor scheduling problem

Abstract

This paper proposes a new method to derive a refined lower bound on the makespan in the multiprocessor scheduling problem. The result of experiments implies that the proposed method really improves the performance of the underlying branch-and-bound scheme when it is applied at the root in the search tree; e.g., we could achieve a speedup of at least 7000 times in the best case. © Springer-Verlag 2003.