LISBOA, R. C. B. F.; LISBOA, Regina Célia Balbino Figueira.
Resumo:
In this work, several heuristic procedures will be studied for scheduling independent tasks. In the first part, we identify the problem of scheduling of independent tasks within the theory of scheduling. The complexity of the results is also described, in order to justify a heuristic approach to most problems. The second part describes several heuristic procedures for the case of single processor and parallel processors, which are identical or not identical. Also implementations of these algorithms are given. Finally, the worst-case behavior for parallel processors is described through limits for the ratio between completion times, which correspond to the heuristic and optimal solutions. Demonstrations are given for the validity of these limits.