MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server

标题
MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server
作者
关键词
-
出版物
COMPUTERS & OPERATIONS RESEARCH
Volume 39, Issue 11, Pages 2457-2468
出版商
Elsevier BV
发表日期
2011-12-23
DOI
10.1016/j.cor.2011.12.011

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

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search

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