DDQN-AJCM Algorithm for Flexible Job Shops Problem with Random Job Arrivals
A DDQN algorithm with attention-based job competition outperforms other methods on dynamic flexible job shop scheduling with random arrivals and generalizes across scales.
Published Mar 21, 2025Paper ↗
Only vote on papers you've read. Sign in to vote.
Abstract
In real-world production systems, unpredictable dynamic events frequently occur, giving rise to the Dynamic Flexible Job Shop Scheduling Problem (DFJSP). As jobs arrive asynchronously and compete for multiple machines, complex interdependencies emerge among them. To address this issue, this study proposes a Double Deep Q-Network (DDQN) algorithm enhanced with an attention mechanism. This method utilizes an Attention-based Job Competition Model (AJCM) to capture the degree of influence between jobs and selectively extracts job information to facilitate representation learning. Numerical experiments conducted on randomly generated production configurations demonstrate that the DDQN-AJCM outperforms other methods in overall performance and exhibits robust generalization capabilities across production environments of varying scales.