Yuanxing Xu

Multi-subpopulation quantum particle swarm optimization with dual chaotic encoding for flexible job-shop scheduling problem

The flexible job-shop scheduling problem (FJSP) is a fundamental challenge in modern manufacturing and artificial intelligence (AI) due to its NP-hard complexity. Efficiently solving the FJSP requires balancing solution quality, computational efficiency, and convergence speed, bu...