Imperialist competitive algorithm based on VNS-OBL optimization for distributed parallel machine scheduling problem

Aiming at the distributed parallel machine scheduling problem(DPMSP) in heterogeneous factories, a new imperialist competitive algorithm (VICA), aiming to minimize the makespan. Firstly, to build a new operator assimilation process and a new kind of revolution. Secondly, by introducing a variable neighborhood search and Opposition-Based Learning(OBL) to improve the quality of imperialist countries, and a new type of the imperialist competitive process was proposed. In the end, a large number of numerical experiments, the results show that the VICA validity and advantage of search in the solution of the problem.