Research on optimization of unrelated parallel machine scheduling based on IG-TS algorithm

Abstract

. This issue is a typical NP-hard problem for an unrelated parallel machine scheduling problem with makespan minimization as the goal and no sequence-related preparation time. Based on the idea of tabu search (TS), this paper improves the iterative greedy algorithm (IG) and proposes an IG–TS algorithm with deconstruction, reconstruction, and neighborhood search operations as the main optimization process. This algorithm has the characteristics of the strong capability of global search and fast speed of convergence. The warp knitting workshop scheduling problem in the textile industry, which has the complex characteristics of a large scale, nonlinearity, uncertainty, and strong coupling, is a typical unrelated parallel machine scheduling problem. The IG–TS algorithm is applied to solve it, and three commonly used scheduling algorithms are set as a comparison, namely the GA–TS algorithm, ABC–TS algorithm, and PSO–TS algorithm. The outcome shows that the scheduling results of the IG–TS algorithm have the shortest manufacturing time and good robustness. In addition, the production comparison between the IG–TS algorithm scheduling scheme and the artificial experience scheduling scheme for the small-scale example problem shows that the IG–TS algorithm scheduling is slightly superior to the artificial experience scheduling in both planning and actual production. Experiments show that the IG–TS algorithm is feasible in warp knitting workshop scheduling problems, effectively realizing the reduction of energy and the increase in efficiency of a digital workshop in the textile industry.