Solving Job-shop Scheduling Problem with an Ant Colony Optimization Algorithm Based on Mutation and Dynamic Pheromone Updating

摘要

The validity of the ant colony algorithm has been demonstrated as a powerful tool solving the optimization. An ant colony optimization algorithm based on mutation and dynamic pheromone updating in this paper was applied to settle job shop scheduling problem. Result of computer simulation shows that this method is effective.