A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem

标题
A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem
作者
关键词
-
出版物
出版商
Elsevier BV
发表日期
2020-01-25
DOI
10.1016/j.ejor.2020.01.039

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

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

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