A Brief Review of Various Meta-Heuristic Optimization Algorithms for Scheduling Issues
Edith Omamuyovwi, Maduku *
Department of Mathematics, Delta State University, Abraka, Nigeria.
John N. Igabari
Department of Mathematics, Delta State University, Abraka, Nigeria.
*Author to whom correspondence should be addressed.
Abstract
Scheduling plays a vital role in various organizations and industrial sectors, ensuring the efficient allocation of tasks to available resources. However, real-world scheduling problems are often complex due to their large scale and numerous constraints. The traditional optimization methods frequently struggle to provide effective solutions for these challenges, necessitating more advanced approaches. In order to address these challenges, meta-heuristic algorithms have been developed, offering powerful techniques for finding optimal or near optimal solutions in complex scheduling scenarios. This study presents a detailed review of existing meta-heuristic algorithms for scheduling problems and highlights their applications across various fields, including manufacturing and production, information technology. The effectiveness of scheduling has been greatly enhanced by utilizing the advantages of diverse meta-heuristic algorithms, making them more suitable for a wide range of applications.
Keywords: Job scheduling, optimization algorithm, meta-heuristics