Examining branch and bound strategy on multiprocessor task scheduling

Abstract

The multiprocessor task graph scheduling problem has been extensively studied as academic optimization problem which occurs in optimizing the execution time of parallel algorithm with parallel computer. The problem is already being known as one of the NP-hard problems. There are many good approaches made with many optimizing algorithm to find out the optimum solution for this problem with less computational time. One of them is branch and bound algorithm. In this paper, we studied the branch and bound algorithm for the multiprocessor scheduling problem.