Minimization of maximum lateness in a flowshop learning effect scheduling with release dates

出版年份 2021 全文链接

标题

作者

关键词

Learning effect, Flowshop scheduling, Maximum lateness, Branch and bound, Discrete artificial bee colony

出版物

COMPUTERS & INDUSTRIAL ENGINEERING

Volume -, Issue -, Pages 107309

出版商

Elsevier BV

发表日期

2021-04-10

DOI

10.1016/j.cie.2021.107309

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

Protocol

在线求助

Reagent

在线求助

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

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started