Constructive heuristics and local search for the flexible job shop problem with sequence flexibility and learning effect

This article explores the flexible job shop problem with sequence flexibility and learning effect (FJSSFLE). We present two constructive heuristics based on dispatching rules along with a local search that uses a reduced neighborhood to solve the problem. We present computational experiments that demonstrate their effectiveness in finding good solutions for small and large instances of the FJSSFLE, and also highlight the advantages and disadvantages of each method.