Jeongwon Park

Dynamic Graph-Based Reinforcement Learning for Efficient Scheduling in Large-Scale Flexible Job Shops

The Flexible Job Shop Scheduling Problem (FJSP) is an NP-hard optimization challenge with significant industrial applications, especially for large-scale instances. Traditional approaches, such as Priority Dispatching Rules (PDRs), often struggle with time-intensive design processes and suboptimal performance as proble...