Combinatorial optimization algorithms combining greedy strategies with a limited search procedure

Resumo

The proposed algorithms basically follow a greedy strategy, and a limited search procedure is invoked only at the steps at which the greedy choice cannot lead to the optimal solution. The principle of these algorithms design are illustrated using the problem of finding the maximum number of compatible jobs as an example. The results of applying the proposed algorithms for scheduling computations in distributed systems are described.