A path relinking with tabu search algorithm for solving hybrid flow shop scheduling problem considering multiple critical paths
Computers & Operations Research · 2024-10 · 170 · 106783
DOI: 10.1016/j.cor.2024.106783 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computers & Operations Research, 2024-10. Verfasst von Hao Zhou und 4 weiteren Autor:innen. Die Arbeit wurde bisher 16-mal zitiert (Crossref) und nennt 46 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Zhou, H., Liu, H., Lv, C., Zhang, C., & Shen, W. (2024). A path relinking with tabu search algorithm for solving hybrid flow shop scheduling problem considering multiple critical paths. Computers & Operations Research, 170, 106783. https://doi.org/10.1016/j.cor.2024.106783
Vancouver
Zhou H, Liu H, Lv C, Zhang C, Shen W. A path relinking with tabu search algorithm for solving hybrid flow shop scheduling problem considering multiple critical paths. Computers & Operations Research. 2024;170:106783. doi:10.1016/j.cor.2024.106783
BibTeX
@article{Zhou2024,
author = {Zhou, Hao and Liu, Hui and Lv, Chang and Zhang, Chaoyong and Shen, Weiming},
title = {A path relinking with tabu search algorithm for solving hybrid flow shop scheduling problem considering multiple critical paths},
journal = {Computers & Operations Research},
year = {2024},
volume = {170},
pages = {106783},
doi = {10.1016/j.cor.2024.106783}
}
EUVIMED