Minimizing the makespan for the two-machine scheduling problem with a single server: Two algorithms for very large instances

标题
Minimizing the makespan for the two-machine scheduling problem with a single server: Two algorithms for very large instances
作者
关键词
-
出版物
ENGINEERING OPTIMIZATION
Volume 48, Issue 1, Pages 173-183
出版商
Informa UK Limited
发表日期
2015-01-30
DOI
10.1080/0305215x.2015.1005083

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

Create your own webinar

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

Create Now

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