.png){kind=icon}
Return
A revised discrete particle swarm optimization algorithm for permutation flow-shop scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-013-1199-z.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This research proposes a revised discrete particle swarm optimization (RDPSO) to solve the permutation flow-shop scheduling problem with the objective of minimizing makespan (PFSP-makespan). The candidate problem is one of the most studied NP-complete scheduling problems. RDPSO proposes new particle swarm learning strategies to thoroughly study how to properly apply the global best solution and the personal best solution to guide the search of RDPSO. A new filtered local search is developed to filter the solution regions that have been reviewed and guide the search to new solution regions in order to keep the search from premature convergence. Computational experiments on Taillard's benchmark problem sets demonstrate that RDPSO significantly outperforms all the existing PSO algorithms.
Keywords:
Permutation flow-shop scheduling problem
Particle swarm optimization
Makespan
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W
Organization
Cited Papers
Structure of the X–linked Kallmann syndrome gene and its homologous pseudogene on the Y chromosome
.png){kind=icon}
PREAI
ShareSave
ShareSaveShareSaveShareSaveShareSaveA hybrid alternate two phases particle swarm optimization algorithm for flow shop scheduling problem
PREAI
ShareSaveShareSaveShareSave
View more