Applying grasps to minimize the makespan on identical parallel machines

  1. Alcaide López de Pablo, David
  2. Mokotoff Miguel, Ethel-Virginia
  3. Sicilia Rodríguez, Joaquín
Buch:
XXVI Congreso Nacional de Estadística e Investigación Operativa: Úbeda, 6-9 de noviembre de 2001

Verlag: Jaén : Universidad de Jaén, 2001

ISBN: 84-8439-080-2

Datum der Publikation: 2001

Kongress: Congreso Nacional de Estadística e Investigación Operativa (26. 2001. Úbeda)

Art: Konferenz-Beitrag

Zusammenfassung

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