Bi-objective Machine Scheduling Using Enhanced Simulated Annealing and Bee Algorithm Approaches
Journal of Engineering · 01.03.2026 · 32 (3) · 150-172
DOI: 10.31026/j.eng.2026.03.09 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Engineering, online erschienen am 01.03.2026. Verfasst von Yasameen M. Mohammed und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Many industrial systems involve multiple criteria and objectives, and they are very complex problems in computational science, such as task scheduling. We propose bi-criteria and bi-objective scheduling problems, which are solved by two nature-inspired evolutionary algorithms, such as Simulated Annealing (SA) and Bee Algorithm (BA). This problem is characterized by scheduling a batch of tasks on multiple machines, and it is fundamental because the solution should focus on the simultaneous optimization of two conflicting objectives: the makespan minimization and the total tardiness minimization. This problem is NP-Hard, and therefore, two evolutionary methods were used to search for solutions intelligently in this huge, very complex space. In this research, A mathematical model of the scheduling problem was developed based on the above objectives. Here, we proposed a tailored tune-up of SA and BA, both of which have been specifically developed and implemented to solve the proposed model for integrated scheduling and delivery, geared for the bifunctional nature of the problem. Quantitative results indicate that the Bee Algorithm (BA) achieves a more diverse Pareto front, with an average improvement of approximately 12–18 % in solution diversity compared to Simulated Annealing (SA). In contrast, SA converges faster, reducing computational time by about 30–40 % for large problem instances (n ≥ 80). Overall, BA provides better trade-offs between objectives, while SA offers superior computational efficiency. The results showed that both algorithms can generate solutions that are balanced and time-efficient.
Zitieren
APA
Mohammed, Y. M., & Abbas, I. T. (2026). Bi-objective Machine Scheduling Using Enhanced Simulated Annealing and Bee Algorithm Approaches. Journal of Engineering, 32(3), 150-172. https://doi.org/10.31026/j.eng.2026.03.09
Vancouver
Mohammed YM, Abbas IT. Bi-objective Machine Scheduling Using Enhanced Simulated Annealing and Bee Algorithm Approaches. Journal of Engineering. 2026;32(3):150-172. doi:10.31026/j.eng.2026.03.09
BibTeX
@article{Mohammed2026,
author = {Mohammed, Yasameen M. and Abbas, Iraq T.},
title = {Bi-objective Machine Scheduling Using Enhanced Simulated Annealing and Bee Algorithm Approaches},
journal = {Journal of Engineering},
year = {2026},
volume = {32},
number = {3},
pages = {150--172},
doi = {10.31026/j.eng.2026.03.09}
}
EUVIMED