Cargando…
A Modified Genetic Algorithm with Local Search Strategies and Multi-Crossover Operator for Job Shop Scheduling Problem †
It is not uncommon for today’s problems to fall within the scope of the well-known class of NP-Hard problems. These problems generally do not have an analytical solution, and it is necessary to use meta-heuristics to solve them. The Job Shop Scheduling Problem (JSSP) is one of these problems, and fo...
Autores principales: | Viana, Monique Simplicio, Morandin Junior, Orides, Contreras, Rodrigo Colnago |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7571099/ https://www.ncbi.nlm.nih.gov/pubmed/32971959 http://dx.doi.org/10.3390/s20185440 |
Ejemplares similares
-
A New Frequency Analysis Operator for Population Improvement in Genetic Algorithms to Solve the Job Shop Scheduling Problem †
por: Viana, Monique Simplicio, et al.
Publicado: (2022) -
A New Local Search Adaptive Genetic Algorithm for the Pseudo-Coloring Problem
por: Contreras, Rodrigo Colnago, et al.
Publicado: (2020) -
A global-local neighborhood search algorithm and tabu search for flexible job shop scheduling problem
por: Escamilla Serna, Nayeli Jazmin, et al.
Publicado: (2021) -
Research on multi-agent genetic algorithm based on tabu search for the job shop scheduling problem
por: Peng, Chong, et al.
Publicado: (2019) -
A DNA algorithm for the job shop scheduling problem based on the Adleman-Lipton model
por: Tian, Xiang, et al.
Publicado: (2020)