Bi-objective optimisation approaches to Job-shop problem with power requirements

作者：

Highlights：

• A Job-shop scheduling problem with power threshold is considered.

• An efficient metaheuristic based on a NSGA-II is proposed.

• A comparison with a bi-objective GRASP×ELS based metaheuristic is provided.

• A specific local search is designed to improve the quality of the Pareto front.

• Metaheuristics are evaluated on designed instances and statistical tests.

摘要

•A Job-shop scheduling problem with power threshold is considered.•An efficient metaheuristic based on a NSGA-II is proposed.•A comparison with a bi-objective GRASP×ELS based metaheuristic is provided.•A specific local search is designed to improve the quality of the Pareto front.•Metaheuristics are evaluated on designed instances and statistical tests.

论文关键词：Scheduling,Job-shop,Power threshold,Metaheuristics,hNSGA-II,iGRASP×ELS

论文评审过程：Received 4 February 2019, Revised 12 June 2020, Accepted 11 July 2020, Available online 19 July 2020, Version of Record 4 August 2020.

论文官网地址：https://doi.org/10.1016/j.eswa.2020.113753