A Hybrid Bin-Packing Heuristic to Multiprocessor Scheduling

A composite algorithm for multiprocessor scheduling

“…CA has been implemented in Fortran and compared with the algorithm of Alvim and Ribeiro (2004a), the algorithm of Dell' Amico and Martello (1995), and the algorithms of Frangioni et al (2004). Four families of instances taken from the literature have been used for the comparison.…”

“…Specifically, the Branch-and-Bound (B&B) algorithm of Dell' Amico and Martello (1995), the multi-exchange (ME) algorithms of Frangioni et al (2004), and the hybrid improvement (HI) algorithm of Alvim and Ribeiro (2004a) have been considered. The latter one proved to be the main competitor.…”

“…Particularly, the competitors are the algorithm of Dell' Amico and Martello (1995), the multi-exchange algorithms of Frangioni et al (2004), and the hybrid improvement algorithm of Alvim and Ribeiro (2004a). The algorithm of Dell'Amico and Martello is a depth-first branch-and-bound procedure; it can represent a special type of heuristic when a limit on the number of backtracks is introduced.…”

Bounding Strategies for Scheduling on Identical Parallel Machines

“…The performance of the proposed bounds was evaluated on a large test-bed of 4150 randomly generated instances (including large-sized instances with up to 10000 jobs and 15 machines) and 780 benchmark ones provided by Alvim and Ribeiro [1]. All our experiments were obtained on a Pentium IV 3.2 GHz Personal Computer with 1.5 GB RAM.…”

“…Mokotoff [15] summarizes much of this research. In addition, several heuristics have been proposed [1,2,3,6,7,10,11,12,20]. However, relatively little attention has been paid so far to the development of lower bounding strategies and exact optimization algorithms.…”