Solving Flow-Shop Scheduling Problems with Random Machine Breakdown and Limited Buffer Using a Pigeon-Inspired Hybrid Artificial Bee Colony Algorithm
Computers · 06.08.2026 · 15 (8) · 508
DOI: 10.3390/computers15080508 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computers, online erschienen am 06.08.2026. Verfasst von Mariappan Kadarkarainadar Marichelvam und 1 weiteren Autor:innen. Die Arbeit nennt 111 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
A hybrid algorithm combining two metaheuristics is proposed to solve the flow-shop scheduling problem, aiming to minimise the makespan (Cmax). This approach accounts for random machine failures and limited buffer capacity between machines. Since flow-shop scheduling problems are NP-hard, the metaheuristics could be used to solve them effectively. Researchers proved that the hybridisation of metaheuristics would improve the solution quality. Therefore, this study hybridises the recently developed Pigeon-Inspired Optimisation Algorithm (PIOA) with the artificial bee colony (ABC) algorithm. The initial solutions are generated using a dynamic generation technique that relies on a set of constructive heuristics. The optimal solutions from the PIOA serve as input for the ABC algorithm. Various local search and variable neighbourhood search methods are also included to enhance solution quality. Extensive computational experiments, which focus on industrial scheduling scenarios and benchmark problem instances, are conducted to test the performance of the hybrid algorithm. Statistical analysis shows that the proposed algorithm outperforms other algorithms found in the existing literature.
Zitieren
APA
Marichelvam, M. K., & Geetha, M. (2026). Solving Flow-Shop Scheduling Problems with Random Machine Breakdown and Limited Buffer Using a Pigeon-Inspired Hybrid Artificial Bee Colony Algorithm. Computers, 15(8), 508. https://doi.org/10.3390/computers15080508
Vancouver
Marichelvam MK, Geetha M. Solving Flow-Shop Scheduling Problems with Random Machine Breakdown and Limited Buffer Using a Pigeon-Inspired Hybrid Artificial Bee Colony Algorithm. Computers. 2026;15(8):508. doi:10.3390/computers15080508
BibTeX
@article{Marichelvam2026,
author = {Marichelvam, Mariappan Kadarkarainadar and Geetha, Mariappan},
title = {Solving Flow-Shop Scheduling Problems with Random Machine Breakdown and Limited Buffer Using a Pigeon-Inspired Hybrid Artificial Bee Colony Algorithm},
journal = {Computers},
year = {2026},
volume = {15},
number = {8},
pages = {508},
doi = {10.3390/computers15080508}
}
EUVIMED