Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

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:

Cloud theory-based simulated annealing for a single-machine past sequence setup scheduling with scenario-dependent processing times
Chin‐Chia Wu, Win-Chin Lin, Xingong Zhang, et al.
Complex & Intelligent Systems (2020) Vol. 7, Iss. 1, pp. 345-357
Open Access | Times Cited: 10

Showing 10 citing articles:

Exploring a Q-learning-based chaotic naked mole rat algorithm for S-box construction and optimization
Kamal Z. Zamli, Fakhrud Din, Hussam S. Alhadawi
Neural Computing and Applications (2023) Vol. 35, Iss. 14, pp. 10449-10471
Closed Access | Times Cited: 20
A state-of-the-art survey on multi-scenario scheduling
Dvir Shabtay, Miri Gilenson
European Journal of Operational Research (2022) Vol. 310, Iss. 1, pp. 3-23
Closed Access | Times Cited: 21
Single machine scheduling in make to order environments: A systematic review
Renan Martinelli, Flávia Cristina Martins Queiroz Mariano, Camila Bertini Martins
Computers & Industrial Engineering (2022) Vol. 169, pp. 108190-108190
Closed Access | Times Cited: 18
Low-consumption with efficient capture and characteristics of heavy metals from coal combustion by modified kaolin: Experimental and simulation studies
Yuxuan Yang, Zhaoping Zhong, Jiefei Li, et al.
Fuel (2022) Vol. 332, pp. 126094-126094
Closed Access | Times Cited: 18
Solving two-stage stochastic route-planning problem in milliseconds via end-to-end deep learning
Jie Zheng, Ling Wang, Shengyao Wang, et al.
Complex & Intelligent Systems (2021) Vol. 7, Iss. 3, pp. 1207-1222
Open Access | Times Cited: 20
A two-agent one-machine multitasking scheduling problem solving by exact and metaheuristics
Chin‐Chia Wu, Ameni Azzouz, Jia‐Yang Chen, et al.
Complex & Intelligent Systems (2021) Vol. 8, Iss. 1, pp. 199-212
Open Access | Times Cited: 6
A Genetic Hyper-Heuristic for an Order Scheduling Problem with Two Scenario-Dependent Parameters in a Parallel-Machine Environment
Lung-Yu Li, Jianyou Xu, Shuenn‐Ren Cheng, et al.
Mathematics (2022) Vol. 10, Iss. 21, pp. 4146-4146
Open Access | Times Cited: 4
Coordinated COVID-19 vaccination scheduling model by using nearest distance-single course timetabling method
Purba Daru Kusuma, Ratna Astuti Nugrahaeni
Bulletin of Electrical Engineering and Informatics (2022) Vol. 11, Iss. 2, pp. 1007-1017
Open Access | Times Cited: 3
Flow shop scheduling problem with non-linear learning effects: A linear approximation scheme for non-technical users
Augusto Ferraro, Daniel Alejandro Rossit, Adrián Toncovich
Journal of Computational and Applied Mathematics (2022) Vol. 424, pp. 114983-114983
Closed Access | Times Cited: 3
A robust multi-response VNS-aiNet approach for solving scheduling problems under unrelated parallel machines environments
Rodney Oliveira Marinho Diana, Sérgio Ricardo de Souza, Elizabeth F. Wanner
Expert Systems with Applications (2021) Vol. 182, pp. 115140-115140
Closed Access | Times Cited: 4
Page 1

Scroll to top