Solving bi-criteria of total earliness times jobs and range of lateness machine scheduling problems by using local search methods
Boletim da Sociedade Paranaense de Matemática · 15.03.2026
DOI: 10.5269/bspm.80725 ↗Kurz gefasst
Fachartikel in der Zeitschrift Boletim da Sociedade Paranaense de Matemática, online erschienen am 15.03.2026. Verfasst von Wadhah Abdulelah Hussein und 2 weiteren Autor:innen. Die Arbeit nennt 16 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
In this paper, two different local search methods (LSMs) have been investigated in this work to solve the bi-criteria 1//(\sum Ej, RL) and bi-objective 1//(\sum Ej + RL) problems. The used LSMs are Bees Algorithm (BA) and Genetic Algorithm (GA), which are effective heuristic approaches. We are comparing the results of the two LSMs with the results of exact methods like Branch and Bound. In terms of optimal solutions and CPU time, this work demonstrates the strong performance of BA and GA when compared to exact and heuristic approaches
Zitieren
APA
Hussein, W. A., Ali, F. H., & Abdullah, Z. M. (2026). Solving bi-criteria of total earliness times jobs and range of lateness machine scheduling problems by using local search methods. Boletim da Sociedade Paranaense de Matemática. https://doi.org/10.5269/bspm.80725
Vancouver
Hussein WA, Ali FH, Abdullah ZM. Solving bi-criteria of total earliness times jobs and range of lateness machine scheduling problems by using local search methods. Boletim da Sociedade Paranaense de Matemática. 2026. doi:10.5269/bspm.80725
BibTeX
@article{Hussein2026,
author = {Hussein, Wadhah Abdulelah and Ali, Faez Hassan and Abdullah, Zeyad M.},
title = {Solving bi-criteria of total earliness times jobs and range of lateness machine scheduling problems by using local search methods},
journal = {Boletim da Sociedade Paranaense de Matemática},
year = {2026},
doi = {10.5269/bspm.80725}
}
EUVIMED