This work deals with the problem of scheduling n independent jobs on m unrelated parallel machines with the objective of minimizing the makespan (the total elapsed time from the start of execution until all jobs are completed). In this work we propose a new local search algorithm in connection with a powerful neighborhood scheme that uses a structure of intervals and uses the efficiency of the machines for each job. The proposed algorithm, called Mutat, is compared with other algorithms in order to evaluate the quality of the solutions obtained. The new approach finds solutions that overcome, in quality and computational time, the best algorithm of local search found in the literature for this problem.
Scheduling; Unrelated machines; Local search; Heuristics
