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:

Intelligent Optimization Under Multiple Factories: Hybrid Flow Shop Scheduling Problem with Blocking Constraints Using an Advanced Iterated Greedy Algorithm
Yong Wang, Yuting Wang, Yuyan Han, et al.
Complex System Modeling and Simulation (2023) Vol. 3, Iss. 4, pp. 282-306
Open Access | Times Cited: 13

Showing 13 citing articles:

Personalized Indicator Based Evolutionary Algorithm for Uncertain Constrained Many‐Objective Optimization Problem With Interval Functions
Jie Wen, Qian Wang, Haiying Dong, et al.
Concurrency and Computation Practice and Experience (2025) Vol. 37, Iss. 3
Closed Access

A Q-learning-driven genetic algorithm for the distributed hybrid flow shop group scheduling problem with delivery time windows
Qianhui Ji, Yuyan Han, Yuting Wang, et al.
Information Sciences (2025), pp. 121971-121971
Closed Access

Accelerated evaluation of blocking flowshop scheduling with total flow time criteria using a generalized critical machine-based approach
Yuyan Han, Yuting Wang, Quan-Ke Pan, et al.
European Journal of Operational Research (2024) Vol. 318, Iss. 2, pp. 424-441
Closed Access | Times Cited: 3

Deterministic Method for Input Sequence Modification in NEH-Based Algorithms
Radosław Puka, Iwona Skalna, Bartosz Łamasz, et al.
IEEE Access (2024) Vol. 12, pp. 68940-68953
Open Access | Times Cited: 2

A Penalty Groups-Assisted Iterated Greedy Integrating Idle Time Insertion: Solving the Hybrid Flow Shop Group Scheduling with Delivery Time Windows
Qianhui Ji, Yuyan Han, Yuting Wang, et al.
Complex System Modeling and Simulation (2024) Vol. 4, Iss. 2, pp. 137-165
Open Access | Times Cited: 2

Dynamic deadline constrained multi-objective workflow scheduling in multi-cloud environments
Xingjuan Cai, Yan Zhang, Mengxia Li, et al.
Expert Systems with Applications (2024) Vol. 258, pp. 125168-125168
Closed Access | Times Cited: 1

Hierarchical Disturbance Propagation Mechanism and Improved Contract Net Protocol for Satellite TT&C Resource Dynamic Scheduling
Zhiqing Xiang, Yi Gu, Xinwei Wang, et al.
Complex System Modeling and Simulation (2024) Vol. 4, Iss. 2, pp. 166-183
Open Access | Times Cited: 1

Explicable recommendation model based on a time‐assisted knowledge graph and many‐objective optimization algorithm
Rui Zheng, Linjie Wu, Xingjuan Cai, et al.
Concurrency and Computation Practice and Experience (2024) Vol. 36, Iss. 21
Closed Access

A dual-population Constrained Many-Objective Evolutionary Algorithm based on reference point and angle easing strategy
Chen Ji, Linjie Wu, Tianhao Zhao, et al.
PeerJ Computer Science (2024) Vol. 10, pp. e2102-e2102
Open Access

Theoretical analysis and implementation of mandatory operations-based accelerated search in graph space for hybrid flow shop scheduling
Yuting Wang, Yuyan Han, Huan Li, et al.
Expert Systems with Applications (2024) Vol. 257, pp. 125026-125026
Closed Access

Distributed hybrid flowshop scheduling with consistent sublots under delivery time windows: A penalty lot-assisted iterated greedy algorithm
Jinli Liu, Yuyan Han, Yuting Wang, et al.
Egyptian Informatics Journal (2024) Vol. 28, pp. 100566-100566
Closed Access

Page 1

Scroll to top