An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times

标题
An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times
作者
关键词
Flowshop, Scheduling, Iterated greedy algorithm, Meta-heuristics
出版物
Swarm and Evolutionary Computation
Volume 59, Issue -, Pages 100742
出版商
Elsevier BV
发表日期
2020-07-15
DOI
10.1016/j.swevo.2020.100742

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

Reprint

联系作者

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

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search