|
A Review of Metaheuristic Algorithms for Job Shop Scheduling |
|---|---|
| รหัสดีโอไอ | |
| Creator | Dharmik Chiragkumar Hajariwala |
| Title | A Review of Metaheuristic Algorithms for Job Shop Scheduling |
| Contributor | Srishti Sudhir Patil, Sudhir Madhav Patil |
| Publisher | Faculty of Engineering Mahasasakham University |
| Publication Year | 2568 |
| Journal Title | Engineering Access |
| Journal Vol. | 11 |
| Journal No. | 1 |
| Page no. | 65-91 |
| Keyword | Job shop scheduling, metaheuristic algorithms, multi-objective, scheduling, scheduling Problem |
| URL Website | https://ph02.tci-thaijo.org/index.php/mijet/index |
| Website title | THAIJO Engineering Access |
| ISSN | 2730-4175 |
| Abstract | Job shop scheduling (JSS) is a critical problem in the field of operations research and manufacturing, where the goal is to optimize the scheduling of jobs on machines to enhance productivity and efficiency. Combinatorial optimization problems like JSS present significant challenges due to their diverse applications and practical importance. In order to meet this challenge, metaheuristic algorithms have become extremely effective tools. They provide effective solutions that strike a balance between computational cost and solution quality. Given the Nondeterministic Polynomial time (NP)-hard nature of the problem, exact methods are often impractical for large instances, making metaheuristic approaches highly valuable due to their ability to find near-optimal solutions within reasonable computational times. The primary purpose of this review manuscript is to comprehensively analyze and synthesize the current state of research on metaheuristic algorithms applied to JSS. This review categorizes and summarizes contemporary metaheuristic methods such as harmony search, and ant colony optimization, alongside traditional techniques like genetic algorithms, simulated annealing, tabu search, and particle swarm optimization. The fundamental concepts, key components, and typical applications of metaheuristic algorithms are explored. The paper evaluates robustness, scalability, and adaptability of different methods to different problem instances and constraints, and performance metrics, highlighting their strengths and weaknesses. Additionally, this paper reviews recent advancements in hybrid and multi-objective metaheuristic methods aimed at balancing scheduling constraints and improving solution quality and convergence speed. By offering a critical evaluation of the literature, this manuscript aims to identify trends, gaps, and future research directions in the application of metaheuristic algorithms to JSS. The discussion includes an exploration of emerging techniques and their potential impact on the field, as well as the practical implications for industrial applications. The conclusion of the review highlights that while significant advancements have been made, there remain numerous opportunities for innovation and improvement in developing more robust, efficient, and adaptive metaheuristic algorithms. Future research should focus on hybrid approaches, real-time scheduling, and integrating machine learning techniques to further enhance the performance and applicability of these algorithms in complex, real-world JSS problems. This comprehensive review not only serves as a valuable resource for researchers and practitioners but also sets the stage for future innovations in the optimization of complex scheduling problems. |
