|
Results This page reports the results achieved for each of the HSCP instances tackled in this project. The tables show the makespan values obtained using deterministic heuristics (MinMin, Sufferage), and evolutionary algorithms (GA, parallel CHC, parallel micro CHC). In addition, a comparative analysis between the methods designed in this project and the results previously reported using other evolutionary and non-evolutionary algorithms for Braun et al.’s instances, is presented. The lower bounds computed for the preemptive version of the problem for each problem instance are also presented.
Makespan results Instances from Braun et al. Problem dimension: 512 tasks, 16 machines—Results
Problem dimension: 1024 tasks, 32 machines—Results
Problem dimension: 2048 tasks, 64 machines—Results
Problem dimension: 4096 tasks, 128 machines—Results
Problem dimension: 8192 tasks, 256 machines—Results
Lower Bounds
LB for instances from Braun et al.—Lower bounds
LB for 1024x32 and 2048x64 problem instances.—Lower bounds
LB for 4196x128 and 8192x256 problem instances.—Lower bounds |
|
HCSP |
|
Heterogeneous Computing Scheduling Problem |
|
HSCP results |
