Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm

标题
Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm
作者
关键词
-
出版物
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Volume 51, Issue 16, Pages 5029-5038
出版商
Informa UK Limited
发表日期
2013-06-10
DOI
10.1080/00207543.2013.790571

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

Find Funding. Review Successful Grants.

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

Explore

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now