VIII. Academic Studies Congress | Andizhan, Uzbekistan

NEH-Guided Artificial Bee Colony Algorithm for Flowshop Scheduling Optimization

Not scheduled

20m

Description

Flowshop scheduling problems involve optimizing the sequence of jobs processed on a fixed number of machines. This research proposes a novel hybrid approach that integrates the Nawaz, Enscore, and Ham (NEH) heuristic with the Artificial Bee Colony (ABC) algorithm specifically for flowshop scheduling. The NEH heuristic, known for its effectiveness in generating good initial schedules, will be used to guide the ABC algorithm's initial search. The ABC algorithm, inspired by foraging behavior of honeybees, is a powerful optimization tool but can struggle with local optima. By leveraging the NEH's capability to identify promising job sequences, this hybrid approach aims to improve the exploration capabilities of the ABC algorithm and steer its search towards high-quality solutions in the flowshop scheduling domain. The performance of the proposed NEH-guided ABC algorithm will be evaluated on benchmark flowshop scheduling problems with the objective of minimizing makespan (completion time of the last job). The results will be compared to the standard ABC algorithm and other existing flowshop scheduling methods. We expect this integration to lead to significantly improved scheduling performance, achieving a lower makespan compared to existing approaches