  The Job Shop Schedule Problem (JSSP) refers to the ability of an agent to
allocate tasks that should be executed in a specified time in a machine from a
cluster. The task allocation can be achieved from several methods, however,
this report it is explored the ability of the Ant Colony Optimization to
generate feasible solutions for several JSSP instances. This proposal models
the JSSP as a complete graph since disjunct models can prevent the ACO from
exploring all the search space. Several instances of the JSSP were used to
evaluate the proposal. Results suggest that the algorithm can reach optimum
solutions for easy and harder instances with a selection of parameters.
