Convergence of Hybrid Grey Wolf Optimization with Heuristic Approaches for Enhanced Job Shop Scheduling

This scholarly inquiry examines the utilization of the Hybrid Grey Wolf Optimization Algorithm (HGWOA) in addressing the Job Shop Scheduling Problem (JSSP), a combinatorial optimization problem commonly encountered within production management. The central aim is to minimize makespan, defined as the cumulative duration necessary to finalize all tasks on a designated set of machines while observing precedence constraints. Conventional Optimization methodologies frequently encounter difficulties with intricate instances of JSSP owing to its NP-hard classification. We introduce a ground-breaking method the Grey Wolf Optimization Algorithm (GWOA) with various meta-heuristic strategies to augment its fruitfulness in resolving JSSP. The multiple findings underscore the usefulness of HGWOA, highlighting its prospective applicability in real-world contexts of production scheduling and management.