Reinforcement Learning Approach for Multi-Agent Flexible Scheduling Problems
원문 초록
Scheduling plays an important role in automated production. Its impact can be found in various fields such as the manufacturing industry, the service industry and the technology industry. A scheduling problem (NP-hard) is a task of finding a sequence of job assignments on a given set of machines with the goal of optimizing the objective defined. Methods such as Operation Research, Dispatching Rules, and Combinatorial Optimization have been applied to scheduling problems but no solution guarantees to find the optimal solution. The recent development of Reinforcement Learning has shown success in sequential decision-making problems. This research presents a Reinforcement Learning approach for scheduling problems. In particular, this study delivers an OpenAI gym environment with search-space reduction for Job Shop Scheduling Problems and provides a heuristic-guided Q-Learning solution with state-of-the-art performance for Multi-agent Flexible Job Shop Problems.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Solving the Job Shop Scheduling Problem with Graph Neural Networks: A Customizable Reinforcement Learning Environment
REMoH: A Reflective Evolution of Multi-objective Heuristics approach via Large Language Models
Improving Performance of Spike-based Deep Q-Learning using Ternary Neurons
Investigating the Performance and Reliability, of the Q-Learning Algorithm in Various Unknown Environments
Actor-Critic Deep Reinforcement Learning for Solving Job Shop Scheduling Problems
Graph-Structured Data Analysis of Component Failure in Autonomous Cargo Ships Based on Feature Fusion
토론
이 논문과 연결된 포럼 글이 아직 없습니다.