A DE-LS Metaheuristic Algorithm for Hybrid Flow-Shop Scheduling Problem considering Multiple Requirements of Customers

Abstract EN

In this paper, we address a hybrid flow-shop scheduling problem with the objective of minimizing the makespan and the cost of delay.

The concerned problem considers the diversity of the customers’ requirements, which influences the procedures of the productions and increases the complexity of the problem.

The features of the problem are inspired by the real-world situations, and the problem is formulated as a mixed-integer programming model in the paper.

In order to tackle the concerned problem, a hybrid metaheuristic algorithm with Differential Evolution (DE) and Local Search (LS) (denoted by DE-LS) has been proposed in the paper.

The differential evolution is a state-of-the-art metaheuristic algorithm which can solve complex optimization problem in an efficient way and has been applied in many fields, especially in flow-shop scheduling problem.

Moreover, the study not only combines the DE and LS, but also modifies the mutation process and provides the novel initialization process and correction strategy of the approach.

The proposed DE-LS has been compared with four variants of algorithms in order to justify the improvements of the proposed algorithm.

Experimental results show that the superiority and robustness of the proposed algorithm have been verified.