Applying grasps to minimize the makespan on identical parallel machines

• Autores: David Alcaide López de Pablo , Ethel-Virginia Mokotoff Miguel , Joaquín Sicilia Rodríguez
• Localización: XXVI Congreso Nacional de Estadística e Investigación Operativa: Úbeda, 6-9 de noviembre de 2001, 2001, ISBN 84-8439-080-2
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• 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