
OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!
If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.
Requested Article:
Solving the flow-shop scheduling problem with human factors and two competing agents with deep reinforcement learning
Tao Ren, Zhuoran Dong, Fang Qi, et al.
Engineering Optimization (2024), pp. 1-17
Closed Access | Times Cited: 5
Tao Ren, Zhuoran Dong, Fang Qi, et al.
Engineering Optimization (2024), pp. 1-17
Closed Access | Times Cited: 5
Showing 5 citing articles:
Preference learning based deep reinforcement learning for flexible job shop scheduling problem
Xinning Liu, Han‐Xiong Li, Ling Kang, et al.
Complex & Intelligent Systems (2025) Vol. 11, Iss. 2
Open Access
Xinning Liu, Han‐Xiong Li, Ling Kang, et al.
Complex & Intelligent Systems (2025) Vol. 11, Iss. 2
Open Access
A systematic review of permutation flow shop scheduling with due-date-related objectives
Bruno de Athayde Prata, Levi Ribeiro de Abreu, Victor Fernández-Viagas
Computers & Operations Research (2025), pp. 106989-106989
Closed Access
Bruno de Athayde Prata, Levi Ribeiro de Abreu, Victor Fernández-Viagas
Computers & Operations Research (2025), pp. 106989-106989
Closed Access
Knowledge-enabled multi-agent deep reinforcement learning approach for batch machine scheduling in semiconductor fabrication
Peng Zhang, Mengyu Jin, Ming Wang, et al.
Engineering Optimization (2025), pp. 1-22
Closed Access
Peng Zhang, Mengyu Jin, Ming Wang, et al.
Engineering Optimization (2025), pp. 1-22
Closed Access
A Lower Bound for Minimizing Waiting Time in Coexisting Virtual and Physical Worlds
Yu-Chuan Chen, Jen-Ya Wang
IEEE Access (2024) Vol. 12, pp. 73470-73480
Open Access
Yu-Chuan Chen, Jen-Ya Wang
IEEE Access (2024) Vol. 12, pp. 73470-73480
Open Access
Hybrid simulated annealing–slime mould algorithm for the non-permutation flow-shop scheduling problem
Anran Zhao, Peng Liu, Xiyu Gao, et al.
Engineering Optimization (2024), pp. 1-13
Closed Access
Anran Zhao, Peng Liu, Xiyu Gao, et al.
Engineering Optimization (2024), pp. 1-13
Closed Access