Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms

出版年份 2017 全文链接

标题

作者

关键词

Distributed no-wait flow shop scheduling problem, Makespan, Iterated greedy algorithm, Neighborhood structures, Local search

出版物

Volume 137, Issue -, Pages 163-181

出版商

Elsevier BV

发表日期

2017-09-21

DOI

10.1016/j.knosys.2017.09.026

联系作者

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

Explore

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now