Open Access · CC BY 4.0
Branch-and-bound algorithm to minimize the total completion time on two dedicated processors
Operations Research Perspectives · 2026-06 · 16 · 100391
DOI: 10.1016/j.orp.2026.100391 ↗Kurz gefasst
Fachartikel in der Zeitschrift Operations Research Perspectives, 2026-06. Verfasst von Adel Kacem und 1 weiteren Autor:innen. Die Arbeit nennt 31 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Kacem, A., & Dammak, A. (2026). Branch-and-bound algorithm to minimize the total completion time on two dedicated processors. Operations Research Perspectives, 16, 100391. https://doi.org/10.1016/j.orp.2026.100391
Vancouver
Kacem A, Dammak A. Branch-and-bound algorithm to minimize the total completion time on two dedicated processors. Operations Research Perspectives. 2026;16:100391. doi:10.1016/j.orp.2026.100391
BibTeX
@article{Kacem2026,
author = {Kacem, Adel and Dammak, Abdelaziz},
title = {Branch-and-bound algorithm to minimize the total completion time on two dedicated processors},
journal = {Operations Research Perspectives},
year = {2026},
volume = {16},
pages = {100391},
doi = {10.1016/j.orp.2026.100391}
}
EUVIMED