Research on Job-Shop Scheduling Problem Based on Genetic Ant Colony Algorithms

The job-shop scheduling problem by the minimum makespan is researched and its mathematical model with multi-restricted condition is established. In order to improve the ant colony algorithm deficiency of poor convergence and easy to fall in local optima, a genetic ant colony algorithm with master-slave structure is designed. In this algorithm, ant colony algorithm is regarded as master algorithm, and genetic algorithm as slave algorithm. Finally, computational tests based on the well known benchmark suites in the literature are conducted, and the computational results show that the presented algorithm is effective in finding optimal and near-optimal solutions.