A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems

标题
A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
作者
关键词
-
出版物
COMPUTERS & OPERATIONS RESEARCH
Volume 35, Issue 9, Pages 2892-2907
出版商
Elsevier BV
发表日期
2007-02-06
DOI
10.1016/j.cor.2007.01.001

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

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