Study of the immune simulated annealing algorithm and dual-resource job shop order scheduling

To solve the flexible Job Shop scheduling order problem of dual-resource constraints , on the basis of considering the production capacity constraints of the workshop and operators, the mathematical description of the problem is given. An improved hybrid immune simulated annealing algorithm is proposed and applied to the scheduling order problem of dual-resource constraints. The global-searching ability is improved. Encoding method and activation decoding algorithm based on the process are used to ensure that any arrangement of chromosomes can produce a feasible solution, reduce the search region, and improve search efficiency. By changing the amount of resources to compare the simulation, the effect of the constraints of the total resources on scheduling order is better concluded. The experimental results show that it is feasible and effectual to solve the scheduling order problem of dual-resource constraints by the improved hybrid immune simulated annealing algorithm.