A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion

标题
A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion
作者
关键词
-
出版物
COMPUTERS & OPERATIONS RESEARCH
Volume 52, Issue -, Pages 260-268
出版商
Elsevier BV
发表日期
2013-10-06
DOI
10.1016/j.cor.2013.09.014

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

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started