Instituto Federal de Educação, Ciência e Tecnologia de São Paulo (IFSP)
Abstract
In this paper, we propose an innovation strategy in the industry (case of the scheduling problem on two parallel identical machines), with the objective of minimizing the weighted sum of the end dates of jobs, this problem is NP-hard. In this frame, we suggested a novel heuristics: (H1), (H2), (H3), with two types of neighborhood (neighborhood by SWAP and neighborhood by INSERT). Next, we analyze the incorporation of three diversification times (T1), (T2), and (T3) with the aim of exploring unvisited regions of the solution space. It must be noted that job movement can be within one zone or between different zones. Computational tests are performed on 6 problems with up to 2 machines and 500 jobs
