A differential evolution algorithm for the customer order scheduling problem with sequence-dependent setup times

作者：

Highlights：

• We address the COSP with sequence-dependent setup times.

• We propose a mixed-integer linear programming model for the problem under study.

• We develop a hybrid DDE metaheuristic with an innovative restart operator.

• We propose two local search procedures based on heuristic dominance rules.

摘要

•We address the COSP with sequence-dependent setup times.•We propose a mixed-integer linear programming model for the problem under study.•We develop a hybrid DDE metaheuristic with an innovative restart operator.•We propose two local search procedures based on heuristic dominance rules.

论文关键词：Customer order scheduling,Production sequencing,Assembly scheduling problems,Total completion time,Metaheuristics

论文评审过程：Received 26 March 2021, Revised 21 August 2021, Accepted 13 October 2021, Available online 24 October 2021, Version of Record 29 October 2021.

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