Learning-Based Approaches for Job Shop Scheduling Problems: A Review
By: Karima Rihane, Adel Dabah, Abdelhakim AitZai
Potential Business Impact:
Helps factories make things faster and cheaper.
Job Shop Scheduling (JSS) is one of the most studied combinatorial optimization problems. It involves scheduling a set of jobs with predefined processing constraints on a set of machines to achieve a desired objective, such as minimizing makespan, tardiness, or flowtime. Since it introduction, JSS has become an attractive research area. Many approaches have been successfully used to address this problem, including exact methods, heuristics, and meta-heuristics. Furthermore, various learning-based approaches have been proposed to solve the JSS problem. However, these approaches are still limited when compared to the more established methods. This paper summarizes and evaluates the most important works in the literature on machine learning approaches for the JSSP. We present models, analyze their benefits and limitations, and propose future research directions.
Similar Papers
Investigating the Monte-Carlo Tree Search Approach for the Job Shop Scheduling Problem
Artificial Intelligence
Makes factories build things faster and cheaper.
A Production Scheduling Framework for Reinforcement Learning Under Real-World Constraints
Machine Learning (CS)
Helps factories make things faster and better.
Self-Evaluation for Job-Shop Scheduling
Machine Learning (CS)
Solves hard planning problems better by checking its own work.