Solving Flexible Job-shop Problem with Sequence-dependent Setup Times by Using Selection Hyper-heuristics

Flexible job shop problem (FJSP), which is inspired by the actual production process, is the most popular research direction in the field of intelligence production. In recent years, a more complex model with sequence-independent setup times (SDST) is proposed to make the solution of the problem in the specific production situation. In this paper, we investigate an FJSB model with SDST which is generated based on replacement of molds and the objective of this model is to minimize the makespan. We also design a selection hyper-heuristic algorithm for the problem. In order to evaluate the algorithm, we solve two problems, classical FJSP and the FJSP with SDST, and compare the results with other methods in other existing literature respectively. The experimental results prove that the approach proposed in this paper overmatch other algorithms in optimization ability and stability.