Preference-Conditioned Graph Reinforcement Learning with Dual-Pool Guidance for Multi-Objective Flexible Job Shop Scheduling

Multi-objective flexible job shop scheduling requires balancing conflicting objectives while supporting real-time decision-making in industrial environments. However, although traditional metaheuristics are effective for global search, their high computational cost limits their applicability in time-sensitive scenarios. To address this issue, this paper proposes dual-pool guided preference-conditioned graph reinforcement learning (DPG-GRL), an encoder–decoder framework for the multi-objective flexible job shop scheduling problem. In DPG-GRL, a graph attention network encoder extracts operation and machine-level representations from a heterogeneous graph, while the decoder is conditioned on a preference vector to generate scheduling solutions with different trade-offs using a single trained policy. To improve sample efficiency and training stability, a dual-pool guidance mechanism is introduced, in which an offline expert pool provides a stable behavioral prior for policy initialization and an online elite pool continuously replays high-quality trajectories to refine the policy. Experimental results show that DPG-GRL outperforms representative multi-objective evolutionary algorithms, including the non-dominated sorting genetic algorithm II (NSGA-II) and the multi-objective evolutionary algorithm based on decomposition (MOEA/D), on synthetic instances, with more pronounced advantages in solution quality and inference efficiency as the problem scale grows. In addition, evaluations on public benchmark instances using a model trained only on the small synthetic setting demonstrate rapid Pareto-front approximation, high-quality solution sets, and promising generalization to unseen instances. These results indicate the potential of DPG-GRL for real-time production scheduling and energy-aware manufacturing.