| 題名: | A revised discrete particle swarm optimization algorithm for permutation flow-shop scheduling problem |
| 作者: | Chen, Chun-Lung
Huang, Shin-Ying
Tzeng, Yeu-Ruey
Chen, Chuen-Lung |
| 貢獻者: | 資工系 |
| 關鍵詞: | Permutation flow-shop scheduling problem
Particle swarm optimization
Makespan |
| 日期: | 2014-11 |
| 上傳時間: | 2015-01-20 10:07:41 (UTC+8) |
| 摘要: | 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. |
| 關聯: | SOFT COMPUTING 卷: 18 期: 11 頁碼: 2271-2282 |
| 顯示於類別: | [資訊工程學系] 期刊論文
|
