A Self-Adjusting Search Domain Method-Based Genetic Algorithm for Solving Flexible Job Shop Scheduling Problem

As a nondeterministic polynomial (NP) problem, the flexible job shop scheduling problem (FJSP) is a difficult problem to be solved in terms of finding an acceptable solution. In last decades, genetic algorithm (GA) displays very promising performance in the field. In this article, a hybrid algorithm...

Descripción completa

Detalles Bibliográficos
Autores principales: Li, Bin, Xia, Xuewen
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi 2022
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9576347/
https://www.ncbi.nlm.nih.gov/pubmed/36262613
http://dx.doi.org/10.1155/2022/4212556

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9576347/
https://www.ncbi.nlm.nih.gov/pubmed/36262613
http://dx.doi.org/10.1155/2022/4212556

Ejemplares similares