EUVIMEDEUVIMED entdecken
Crossref

A graph reinforcement learning-enhanced memetic algorithm for flexible job shop scheduling problem

Junwen Yang, Dapeng Zhang, Zeqiang Ren, Haoyu Wang, Yuqi Zhao, Jian Xiong

Swarm and Evolutionary Computation · 2026-08 · 107 · 102472

DOI: 10.1016/j.swevo.2026.102472 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Swarm and Evolutionary Computation, 2026-08. Verfasst von Junwen Yang und 5 weiteren Autor:innen. Die Arbeit nennt 68 Literaturangaben. Gefördert von: Sichuan Province Science and Technology Support Program, Yunnan Provincial Department of Education Science Research Fund Project, National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Sichuan Province Science and Technology Support Program
  • Yunnan Provincial Department of Education Science Research Fund Project
  • National Natural Science Foundation of China

Zitieren

APA

Yang, J., Zhang, D., Ren, Z., Wang, H., Zhao, Y., & Xiong, J. (2026). A graph reinforcement learning-enhanced memetic algorithm for flexible job shop scheduling problem. Swarm and Evolutionary Computation, 107, 102472. https://doi.org/10.1016/j.swevo.2026.102472

Vancouver

Yang J, Zhang D, Ren Z, Wang H, Zhao Y, Xiong J. A graph reinforcement learning-enhanced memetic algorithm for flexible job shop scheduling problem. Swarm and Evolutionary Computation. 2026;107:102472. doi:10.1016/j.swevo.2026.102472

BibTeX
@article{Yang2026,
  author = {Yang, Junwen and Zhang, Dapeng and Ren, Zeqiang and Wang, Haoyu and Zhao, Yuqi and Xiong, Jian},
  title = {A graph reinforcement learning-enhanced memetic algorithm for flexible job shop scheduling problem},
  journal = {Swarm and Evolutionary Computation},
  year = {2026},
  volume = {107},
  pages = {102472},
  doi = {10.1016/j.swevo.2026.102472}
}
Kostenlos starten →