Cargando…
Research on multi-agent genetic algorithm based on tabu search for the job shop scheduling problem
The solution to the job shop scheduling problem (JSSP) is of great significance for improving resource utilization and production efficiency of enterprises. In this paper, in view of its non-deterministic polynomial properties, a multi-agent genetic algorithm based on tabu search (MAGATS) is propose...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Public Library of Science
2019
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6764687/ https://www.ncbi.nlm.nih.gov/pubmed/31560722 http://dx.doi.org/10.1371/journal.pone.0223182 |