A Multipopulation PSO Based Memetic Algorithm for Permutation Flow Shop Scheduling

The permutation flow shop scheduling problem (PFSSP) is part of production scheduling, which belongs to the hardest combinatorial optimization problem. In this paper, a multipopulation particle swarm optimization (PSO) based memetic algorithm (MPSOMA) is proposed in this paper. In the proposed algor...

Descripción completa

Detalles Bibliográficos
Autores principales: Liu, Ruochen, Ma, Chenlin, Ma, Wenping, Li, Yangyang
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi Publishing Corporation 2013
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3876833/
https://www.ncbi.nlm.nih.gov/pubmed/24453841
http://dx.doi.org/10.1155/2013/387194

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3876833/
https://www.ncbi.nlm.nih.gov/pubmed/24453841
http://dx.doi.org/10.1155/2013/387194

Ejemplares similares