Cargando…
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...
Autores principales: | Liu, Ruochen, Ma, Chenlin, Ma, Wenping, Li, Yangyang |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi Publishing Corporation
2013
|
Materias: | |
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 |
Ejemplares similares
-
Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling
por: Luo, Qifang, et al.
Publicado: (2014) -
A Multipopulation Coevolutionary Strategy for Multiobjective Immune Algorithm
por: Shi, Jiao, et al.
Publicado: (2014) -
A Reinforcement Learning Approach to Robust Scheduling of Permutation Flow Shop
por: Zhou, Tao, et al.
Publicado: (2023) -
A PSO-Based Hybrid Metaheuristic for Permutation Flowshop Scheduling Problems
por: Zhang, Le, et al.
Publicado: (2014) -
Handbook of Memetic Algorithms
por: Neri, Ferrante, et al.
Publicado: (2012)