Procedimentos heurísticos em problemas de scheduling com restrições de procedência e recursos.

Abstract

This work tries to show heuristic procedures in scheduling problems with precedence and resource constraints. For this, it presents procedures based on scheduling of lists that, although they can not guarantee optimum solutions, produce results. A general model of the scheduling problem is presented and illustrated with examples. A procedure based on the Hu Algorithm is implemented for problems with special precedence structures (tree structure). A generalization of this procedure is and aims to solve scheduling problems with more general structures of precedence and resources. The resulting procedure can then, be applied, heuristically, to all other problems addressed in this paper.