Diverse policy generation for the flexible job-shop scheduling problem via deep reinforcement learning with a novel graph representation

In scheduling problems common in the industry and various real-world scenarios, responding in real-time to disruptive events is important. Recent methods propose the use of deep reinforcement learning (DRL) to learn policies capable of generating solutions under this constraint. However, current DRL approaches struggle with large instances, which are common in real-world scenarios. The objective of this paper is to introduce a new DRL method for solving the flexible job-shop scheduling problem, with a focus on these type of instances. The approach is based on the use of heterogeneous graph neural networks to a more informative graph representation of the problem. This novel modeling of the problem enhances the policy's ability to capture state information and improve its decision-making capacity. Additionally, we introduce two novel approaches to enhance the performance of the DRL approach: the first involves generating a diverse set of scheduling policies, while the second combines DRL with dispatching rules (DRs) constraining the action space, with a variable degree of freedom depending on the chosen policy. Experimental results on two public benchmarks show that our approach outperforms DRs and achieves superior results compared to three state-of-the-art DRL methods, particularly for large instances.