Applying grasps to minimize the makespan on identical parallel machines
- Alcaide López de Pablo, David
- Mokotoff Miguel, Ethel-Virginia
- Sicilia Rodríguez, Joaquín
Editorial: Jaén : Universidad de Jaén, 2001
ISBN: 84-8439-080-2
Año de publicación: 2001
Congreso: Congreso Nacional de Estadística e Investigación Operativa (26. 2001. Úbeda)
Tipo: Aportación congreso
Resumen
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