Crossref
Parallel shifting bottleneck algorithms for non-permutation flow shop scheduling
Annals of Operations Research · 2024-12 · 343 (1) · 39-65
DOI: 10.1007/s10479-024-06329-2 ↗Kurz gefasst
Fachartikel in der Zeitschrift Annals of Operations Research, online erschienen am 06.10.2024. Verfasst von Hossein Badri und 2 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 50 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Badri, H., Bahreini, T., & Grosu, D. (2024). Parallel shifting bottleneck algorithms for non-permutation flow shop scheduling. Annals of Operations Research, 343(1), 39-65. https://doi.org/10.1007/s10479-024-06329-2
Vancouver
Badri H, Bahreini T, Grosu D. Parallel shifting bottleneck algorithms for non-permutation flow shop scheduling. Annals of Operations Research. 2024;343(1):39-65. doi:10.1007/s10479-024-06329-2
BibTeX
@article{Badri2024,
author = {Badri, Hossein and Bahreini, Tayebeh and Grosu, Daniel},
title = {Parallel shifting bottleneck algorithms for non-permutation flow shop scheduling},
journal = {Annals of Operations Research},
year = {2024},
volume = {343},
number = {1},
pages = {39--65},
doi = {10.1007/s10479-024-06329-2}
}
EUVIMED