A hybrid heuristic for the machine scheduling problem with parallel machines

We consider the unrelated parallel machine scheduling problem with a makespan objective. We discuss two heuristic approaches and the hybridization of these heuristics with a truncated branch-and-bound procedure. We compare the performances of these heuristics on standard data available in literature and examine the influence of the different heuristic parameters. The computational experiments reveal that the hybrid heuristics are able to compete with the best known results from the literature.