A computational efficient optimization of flow shop scheduling problems

Flow shop scheduling problems are NP-hard problems. Heuristic algorithms and evolutionary metaheuristic algorithms are commonly used to solve this kind of problem. Although heuristic algorithms have high solving speed, the solution quality is not good. Evolutionary algorithms make up for this defect...

Descripción completa

Detalles Bibliográficos
Autores principales: Liang, Zhongyuan, Zhong, Peisi, Liu, Mei, Zhang, Chao, Zhang, Zhenyu
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Nature Publishing Group UK 2022
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8764078/
https://www.ncbi.nlm.nih.gov/pubmed/35039598
http://dx.doi.org/10.1038/s41598-022-04887-8

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8764078/
https://www.ncbi.nlm.nih.gov/pubmed/35039598
http://dx.doi.org/10.1038/s41598-022-04887-8

Ejemplares similares