EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-ND 4.0

A Cooperative Multi-Agent Reinforcement Learning Guided Iterated Greedy Algorithm for Hybrid Flow Shop Scheduling Problem with Unrelated Parallel Machines

Ahmed Missaoui, Barry O’Sullivan

Procedia Computer Science · 2026 · 292 · 5055-5064

DOI: 10.1016/j.procs.2026.10.076 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Procedia Computer Science, 2026. Verfasst von Ahmed Missaoui und 1 weiteren Autor:innen. Die Arbeit nennt 26 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0). Gefördert von: University College Cork.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • University College Cork

Zitieren

APA

Missaoui, A., & O’Sullivan, B. (2026). A Cooperative Multi-Agent Reinforcement Learning Guided Iterated Greedy Algorithm for Hybrid Flow Shop Scheduling Problem with Unrelated Parallel Machines. Procedia Computer Science, 292, 5055-5064. https://doi.org/10.1016/j.procs.2026.10.076

Vancouver

Missaoui A, O’Sullivan B. A Cooperative Multi-Agent Reinforcement Learning Guided Iterated Greedy Algorithm for Hybrid Flow Shop Scheduling Problem with Unrelated Parallel Machines. Procedia Computer Science. 2026;292:5055-5064. doi:10.1016/j.procs.2026.10.076

BibTeX
@article{Missaoui2026,
  author = {Missaoui, Ahmed and O’Sullivan, Barry},
  title = {A Cooperative Multi-Agent Reinforcement Learning Guided Iterated Greedy Algorithm for Hybrid Flow Shop Scheduling Problem with Unrelated Parallel Machines},
  journal = {Procedia Computer Science},
  year = {2026},
  volume = {292},
  pages = {5055--5064},
  doi = {10.1016/j.procs.2026.10.076}
}
Kostenlos starten →