EUVIMEDEUVIMED entdecken
Crossref

A dual-heuristic crossover genetic algorithm with variable neighborhood search for flexible job shop scheduling with transportation times

Jinling Bei, Jiquan Wang, Fanfan Lou

Computers & Operations Research · 2026-09 · 193 · 107503

DOI: 10.1016/j.cor.2026.107503 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Computers & Operations Research, 2026-09. Verfasst von Jinling Bei und 2 weiteren Autor:innen. Die Arbeit nennt 61 Literaturangaben. Gefördert von: National Social Science Fund of China, National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • National Social Science Fund of China
  • National Natural Science Foundation of China

Zitieren

APA

Bei, J., Wang, J., & Lou, F. (2026). A dual-heuristic crossover genetic algorithm with variable neighborhood search for flexible job shop scheduling with transportation times. Computers & Operations Research, 193, 107503. https://doi.org/10.1016/j.cor.2026.107503

Vancouver

Bei J, Wang J, Lou F. A dual-heuristic crossover genetic algorithm with variable neighborhood search for flexible job shop scheduling with transportation times. Computers & Operations Research. 2026;193:107503. doi:10.1016/j.cor.2026.107503

BibTeX
@article{Bei2026,
  author = {Bei, Jinling and Wang, Jiquan and Lou, Fanfan},
  title = {A dual-heuristic crossover genetic algorithm with variable neighborhood search for flexible job shop scheduling with transportation times},
  journal = {Computers & Operations Research},
  year = {2026},
  volume = {193},
  pages = {107503},
  doi = {10.1016/j.cor.2026.107503}
}
Kostenlos starten →