EUVIMEDEUVIMED entdecken
Crossref

A dual-agent neighborhood search algorithm for solving hybrid flowshop scheduling problem

Chengshuai Li, Hongfei Guo, Yaping Ren, Leilei Meng, Yuyan Han, Chaoyong Zhang

Computers & Operations Research · 2026-07 · 191 · 107466

DOI: 10.1016/j.cor.2026.107466 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Computers & Operations Research, 2026-07. Verfasst von Chengshuai Li und 5 weiteren Autor:innen. Die Arbeit nennt 51 Literaturangaben. Gefördert von: Inner Mongolia Autonomous Region Natural Science Foundation, Department of Education of Guizhou Province, National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Inner Mongolia Autonomous Region Natural Science Foundation
  • Department of Education of Guizhou Province
  • National Natural Science Foundation of China

Zitieren

APA

Li, C., Guo, H., Ren, Y., Meng, L., Han, Y., & Zhang, C. (2026). A dual-agent neighborhood search algorithm for solving hybrid flowshop scheduling problem. Computers & Operations Research, 191, 107466. https://doi.org/10.1016/j.cor.2026.107466

Vancouver

Li C, Guo H, Ren Y, Meng L, Han Y, Zhang C. A dual-agent neighborhood search algorithm for solving hybrid flowshop scheduling problem. Computers & Operations Research. 2026;191:107466. doi:10.1016/j.cor.2026.107466

BibTeX
@article{Li2026,
  author = {Li, Chengshuai and Guo, Hongfei and Ren, Yaping and Meng, Leilei and Han, Yuyan and Zhang, Chaoyong},
  title = {A dual-agent neighborhood search algorithm for solving hybrid flowshop scheduling problem},
  journal = {Computers & Operations Research},
  year = {2026},
  volume = {191},
  pages = {107466},
  doi = {10.1016/j.cor.2026.107466}
}
Kostenlos starten →