Characterization of the iterative application of makespan heuristics on non-makespan machines in a heterogeneous parallel and distributed environment

An ordered heuristic for the allocation of resources in unrelated parallel-machines

“…Some of the most used algorithms, presented in (Ibbara et al 1997 (Briceño et al, 2012;Chaturvedi & Sahu 2011;Pfund et al, 2004) to the problem are the Suffrage heuristics that allocates the tasks that would suffer more when not allocated to their favorite machine first, KPB (K-Percent Best) and SWA (Switching Algorithm) that combine the MET and MCT heuristics, WQ (Work Queue) that allocates task to the machine with the minimum work load. DFPLTF (Dynamic Fastest Processor to Largest Task First) and RR can be used to approach the dynamic Rm||Cmax problem.…”

“…This does not take into consideration tasks already allocated, what can result in an inefficient solution when several tasks are allocated to one machine (Braun et al, 2001;Briceño et al, 2012;Ibbara et al, 1997). The MET algorithm is:…”

“…The MCT (Minimum Completion Time) heuristic uses the completion time to allocate tasks; this takes into consideration tasks already allocated, in opposition to MET heuristics (Braun et al, 2001;Briceño et al, 2012;Ibbara et al, 1997). The MCT algorithm is:…”

“…First, the machines with the minimum completion time for each task are determined, then, between the task/machine pairs determined in the first step the one with lowest completion time is allocated. This approach makes this heuristic indifferent to the sequence in which the tasks are allocated (Braun et al, 2001;Briceño et al, 2012;Chaturvedi & Sahu 2011;Gupta & Singh, 2012) The Min-Min algorithm is:…”

“…Suffrage finds the minimum and second minimum completion time for each task. When there are several tasks with the minimum completion time in the same machine, the one that would suffer more by being allocated to the machine with the second best completion time is allocated to the minimal completion time machine (Briceño et al, 2012;Gupta & Singh, 2012;Paranhos & Brasileiro 2003). Suffrage allocates first the tasks that would have more impact in the makespan, when they are not allocated to their favorite machine.…”