Particle swarm optimization with expanding neighborhood topology for the permutation flowshop scheduling problem

标题
Particle swarm optimization with expanding neighborhood topology for the permutation flowshop scheduling problem
作者
关键词
Permutation flowshop scheduling problem, Particle swarm optimization, Expanding Neighborhood topology, Variable neighborhood search, Path relinking
出版物
SOFT COMPUTING
Volume 17, Issue 7, Pages 1159-1173
出版商
Springer Nature
发表日期
2013-02-05
DOI
10.1007/s00500-013-0992-z

向作者/读者发起求助以获取更多资源

Reprint

联系作者

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More