A self-learning Variable Neighborhood Search algorithm based on reinforcement learning for Green flexible job-shop scheduling problem
摘要
Green scheduling systems are attracting increasing attention due to their environmental impacts. This paper addresses the Green Flexible Job-Shop Scheduling Problem with variable processing speeds, aiming to minimize both the makespan and total energy consumption. To solve this problem, we propose a self-learning Variable Neighborhood Search with Q-learning (SL_VNS) algorithm, which integrates three key mechanisms: (1) four initialization strategies designed to generate high-quality initial solutions; (2) A parameter adaptation strategy based on reinforcement learning to select optimal parameters dynamically; and (3) an elite archive to save historical solutions for improved performance. Computational experiments demonstrate that the proposed algorithm is more effective and robust compared to other algorithms.