The branch and bound algorithm improvement in divisible load scheduling with result collection on heterogeneous systems by new heuristic function

In this paper we propose a new heuristic function for branch and bound algorithm. By this function we can increase the efficiency of branch and bound algorithm. Divisible loads represent computations which can be arbitrarily divided into parts and performed independently parallel. The scheduling problem consists in distributing the load in a heterogeneous system taking into account communication and computation times, so that the whole processing time is as short as possible. Since our scheduling problem is computationally hard, we propose a branch & bound algorithm. By simulating and comparing results it is observed which this result produces better answers than other methods, it means that branch and bound algorithm have less total average of relative error percentage in the variety Heuristic functions.