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

dc.contributor.author	Hernández Gress, Eva Selene	es
dc.date.accessioned	2014-06-24T21:35:24Z
dc.date.available	2014-06-24T21:35:24Z
dc.date.issued	2013	es
dc.identifier.citation	Hernández Gress Eva Selene, Seck Tuoh Mora Juan Carlos, E	es
dc.identifier.uri	https://repository.uaeh.edu.mx/bitstream/handle/123456789/15273
dc.description.abstract	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.	es
dc.language	es	es
dc.subject	Análisis, Diseño y Optimización de Sistemas Sociotécnicos	es
dc.title	The job shop scheduling problem solved with the travel salesman problem and genetic algorithms	es
dc.type	Presentation	es