Task scheduling algorithms based on heuristic search taking account of communication overhead

We propose task scheduling algorithms taking account of communication overhead. The conventional algorithms based on search cannot find solutions in practical time due to combinatorial explosion. Our algorithms can find better solutions in practical time than any heuristic algorithms because they search only the search space where better solutions are likely to exist using good heuristics. The first solution candidate that the grouping priority levels (GP) method finds is the same as the solution given by the heuristic algorithm with no search. So it will find some solutions better or equal to ones given by the heuristic algorithm.