A quantum behaved particle swarm optimization for flexible job shop scheduling
详细信息 查看全文
- 作者：Manas Ranjan Singh manasranjan.singh@gmail.com" class="auth_mail" title="E-mail the corresponding author ; S.S. Mahapatra ; mahapatrass2003@yahoo.com" class="auth_mail" title="E-mail the corresponding author
- 关键词：Flexible job shop scheduling ; QPSO ; Mutation ; Chaotic numbers ; Makespan
- 刊名：Computers & Industrial Engineering
- 出版年：2016
- 出版时间：March 2016
- 年：2016
- 卷：93
- 期：Complete
- 页码：36-44
- 全文大小：462 K
文摘
- •
QPSO is proposed to solve FJSS problem to improve global search ability.
- •
Mutation has been introduced in QPSO to avoid premature convergence.
- •
QPSO outperforms other algorithms in most of the benchmark instances.