The job shop scheduling problem solved with the travel salesman problem and genetic algorithms

In this paper we proposed a solution to the JobShop Scheduling Problem using the Traveling Salesman Problem solved by Genetic Algorithms. Different tests are performed to solve the Traveling Salesman Problem with the two types of selection (tournament and roulette) under different parameters: number of individuals, number of iterations, crossover probability and mutation probability. Then the best type of selection and the best parameters are used to solve the Job-Shop Scheduling Problem through the Traveling Salesman Problem. Different cases in the literature are solved to compare results.