.png){kind=icon}
Return
A combinatorial particle swarm optimisation for solving permutation flowshop problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2007.09.006.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The m-machine permutation flowshop problem PFSP with the objectives of minimizing the makespan and the total flowtime is a common scheduling problem, which is known to be NP-complete in the strong sense, when m >= 3. This work proposes a new algorithm for solving the permutation FSP, namely combinatorial Particle Swarm Optimization. Furthermore, we incorporate in this heuristic an improvement procedure based on the simulated annealing approach. The proposed algorithm was applied to well-known benchmark problems and compared with several competing metaheuristics. (C) 2007 Elsevier Ltd. All rights reserved.
Keywords:
particle swarm optimization
combinatorial particle swarm optimization
permutation flowshop problem
makespan
flowtime
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
View more