A hybrid Jaya algorithm for solving flexible job shop scheduling problem considering multiple critical paths

标题
A hybrid Jaya algorithm for solving flexible job shop scheduling problem considering multiple critical paths
作者
关键词
Flexible job shop scheduling, Hybrid Jaya algorithm, Tabu search, Multiple critical paths, Neighborhood structures
出版物
JOURNAL OF MANUFACTURING SYSTEMS
Volume 60, Issue -, Pages 298-311
出版商
Elsevier BV
发表日期
2021-06-22
DOI
10.1016/j.jmsy.2021.05.018

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

Reprint

联系作者

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