Solving non-permutation flow-shop scheduling problem via a novel deep reinforcement learning approach
Computers & Operations Research · 2023-03 · 151 · 106095
DOI: 10.1016/j.cor.2022.106095 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computers & Operations Research, 2023-03. Verfasst von Zhenyu Wang und 5 weiteren Autor:innen. Die Arbeit wurde bisher 43-mal zitiert (Crossref) und nennt 53 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Wang, Z., Cai, B., Li, J., Yang, D., Zhao, Y., & Xie, H. (2023). Solving non-permutation flow-shop scheduling problem via a novel deep reinforcement learning approach. Computers & Operations Research, 151, 106095. https://doi.org/10.1016/j.cor.2022.106095
Vancouver
Wang Z, Cai B, Li J, Yang D, Zhao Y, Xie H. Solving non-permutation flow-shop scheduling problem via a novel deep reinforcement learning approach. Computers & Operations Research. 2023;151:106095. doi:10.1016/j.cor.2022.106095
BibTeX
@article{Wang2023,
author = {Wang, Zhenyu and Cai, Bin and Li, Jun and Yang, Deheng and Zhao, Yang and Xie, Huan},
title = {Solving non-permutation flow-shop scheduling problem via a novel deep reinforcement learning approach},
journal = {Computers & Operations Research},
year = {2023},
volume = {151},
pages = {106095},
doi = {10.1016/j.cor.2022.106095}
}
EUVIMED