Distributional reinforcement learning with the independent learners for flexible job shop scheduling problem with high variability
Seung Heon Oh, Young In Cho, Jong Hun Woo
Abstract
Abstract Multi-agent scheduling algorithm is a useful method for the flexible job shop scheduling problem (FJSP). Also, the variability of the target system has to be considered in the scheduling problem that includes the machine failure, the setup change, etc. This study proposes the scheduling method that combines the independent learners with the implicit quantile network by modeling of the FJSP with high variability to the form of the multi-agent. The proposed method demonstrates superior performance compared to the several known heuristic dispatching rules. In addition, the trained model exhibits superior performance compared to the reinforcement learning algorithms such as proximal policy optimization and deep Q-network.