Local search based methods for scheduling in the unrelated parallel machines environment
作者：
Highlights：
• Initial solution selection has high influence on metaheuristic performance.
• Simple local search methods can easily outperform metaheuristics.
• Simple metaheuristics perform better than more complex ones.
• The selection of appropriate local search operators is mandatory.
• More effort should be invested in local search than metaheuristic design.
摘要
•Initial solution selection has high influence on metaheuristic performance.•Simple local search methods can easily outperform metaheuristics.•Simple metaheuristics perform better than more complex ones.•The selection of appropriate local search operators is mandatory.•More effort should be invested in local search than metaheuristic design.
论文关键词：Scheduling,Unrelated machines environment,Metaheuristic,Local search,Iterated local search,Total weighted tardiness
论文评审过程：Received 27 July 2021, Revised 20 January 2022, Accepted 12 March 2022, Available online 26 March 2022, Version of Record 12 April 2022.
论文官网地址：https://doi.org/10.1016/j.eswa.2022.116909
