Abstract :
The problem of scheduling projects is dealt with in this study with the aim of comparing tools in order to find the optimum or near-optimum solution. There is an infinite number of tools that serve this purpose, both the traditional ones based on more sophisticated mathematical formulations, and the more modern and experimental ones that utilize techniques of artificial intelligence.
The conventional methods with a mathematical basis, exemplified by the technique of Branch and Bound, and those using specific computational packages to find solutions, such as GAMS, are highly efficient in solving problems of project scheduling that consider the temporal organization of a set of tasks so as to fulfil given objectives. In this type of problem, restrictions involving resources and various other restrictions are considered in order to schedule the project.
In recent years many different ways of solving problems were employed in order to find the best solution for this kind of scheduling, which nearly always turns out to involve an extremely complex problem of overall scheduling when real situations are considered. At present much more modern methods have arisen to solve problem, within the technique of Artificial Intelligence, bringing advantages and disadvantages. This technique was devised to help choose the most suitable tool for the problem at hand.
