EUVIMEDEUVIMED entdecken
Crossref

Dual-path information bottleneck-enhanced heterogeneous graph attention networks for dynamic flexible job-shop scheduling problem

Fangyu Li, Jiarong Du, Jingjing Wang, Honggui Han

Swarm and Evolutionary Computation · 2026-06 · 106 · 102431

DOI: 10.1016/j.swevo.2026.102431 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Swarm and Evolutionary Computation, 2026-06. Verfasst von Fangyu Li und 3 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 42 Literaturangaben. Gefördert von: Beijing Nova Program, National Natural Science Foundation of China, National Key Research and Development Program of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Beijing Nova Program
  • National Natural Science Foundation of China
  • National Key Research and Development Program of China

Zitieren

APA

Li, F., Du, J., Wang, J., & Han, H. (2026). Dual-path information bottleneck-enhanced heterogeneous graph attention networks for dynamic flexible job-shop scheduling problem. Swarm and Evolutionary Computation, 106, 102431. https://doi.org/10.1016/j.swevo.2026.102431

Vancouver

Li F, Du J, Wang J, Han H. Dual-path information bottleneck-enhanced heterogeneous graph attention networks for dynamic flexible job-shop scheduling problem. Swarm and Evolutionary Computation. 2026;106:102431. doi:10.1016/j.swevo.2026.102431

BibTeX
@article{Li2026,
  author = {Li, Fangyu and Du, Jiarong and Wang, Jingjing and Han, Honggui},
  title = {Dual-path information bottleneck-enhanced heterogeneous graph attention networks for dynamic flexible job-shop scheduling problem},
  journal = {Swarm and Evolutionary Computation},
  year = {2026},
  volume = {106},
  pages = {102431},
  doi = {10.1016/j.swevo.2026.102431}
}
Kostenlos starten →