Resumen de Applying grasps to minimize the makespan on identical parallel machines

David Alcaide López de Pablo, Ethel-Virginia Mokotoff Miguel, Joaquín Sicilia Rodríguez

• We consider one of the problems in deterministic scheduling theory: to schedule n independent and nonpreemptable jobs on m identical parallel machines, so as to minimize overall completion time. The problem is known to be NP-hard in the strong sense. We study the performance of the GRASP methodology applied to this problem and we have carried out computational experiments