Heuristic algorithms for solving a set of NP-hard single-machine scheduling problems with resource-dependent processing times

标题
Heuristic algorithms for solving a set of NP-hard single-machine scheduling problems with resource-dependent processing times
作者
关键词
Scheduling, Resource-dependent processing times, Resource allocation, Bicriteria optimization, Heuristics
出版物
COMPUTERS & INDUSTRIAL ENGINEERING
Volume 153, Issue -, Pages 107024
出版商
Elsevier BV
发表日期
2020-12-08
DOI
10.1016/j.cie.2020.107024

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

Reprint

联系作者

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

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