Dual Resource Constrained Flexible Job Shop Scheduling Based On Improved Quantum Genetic Algorithm

Aiming at solving the problem of dual resource constrained flexible job shop scheduling problem (DRCFJSP) with differences in operating time between operators, an artificial intelligence (AI)-based DRCFJSP optimization model is developed in this paper. This model introduces the differences between the loading and unloading operation time of workers before and after the process. Subsequently, the quantum genetic algorithm (QGA) is used as the carrier; the process is coded through quantum coding; and the niche technology is used to initialize the population, adaptive rotation angle, and quantum mutation strategy to improve the efficiency of the QGA and avoid premature convergence. Lastly, through the Kacem standard calculation example and the reliability analysis of the factory workshop processing process example, performance evaluation is conducted to show that the improved QGA has good convergence and does not fall into premature ability, the improved QGA can solve the problem of reasonable deployment of machines and personnel in the workshop, and the proposed method is more effective for the DRCFJSP than some existing methods. The findings can provide a good theoretical basis for actual production and application.