The flexible job-shop scheduling problem surpasses the limitations of conventional workshop scheduling problems that reduce machine constraints, increase uncertainty, and belong to the NP-hard problem. An adaptive simulated annealing genetic algorithm based on reinforcement learning is put forward to overcome the constraints of complex parameter determination and poor local search capabilities that standard genetic algorithms face when dealing with flexible job shop scheduling. The approach uses a multi-parent POX crossover operation and introduces a simulated annealing algorithm into the mutation operation to enhance the method's capability for both global and local optimization in the evolution process. The tournament method is combined with the optimal strategy to ensure the algorithm's convergence. The crossover and mutation parameters are dynamically adjusted and optimized using the reinforcement learning algorithm in conjunction with the improved simulated annealing genetic algorithm so that the parameters of the algorithm can adapt to the evolution process according to experience, and the searchability and computational efficiency of the algorithm are improved. By testing and examining the common examples, the proposed algorithm's rationality and superiority are ultimately demonstrated.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.