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:

Intelligent optimization under the makespan constraint: Rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem
Yuhang Wang, Yuyan Han, Yuting Wang, et al.
European Journal of Operational Research (2023) Vol. 311, Iss. 3, pp. 816-832
Closed Access | Times Cited: 35

Showing 26-50 of 35 citing articles:

Integrating meta-heuristics and a Sarsa algorithm for disassembly scheduling problems with cycle time and hazard coefficients
Dachao Li, Kaizhou Gao, Yaxian Ren, et al.
Green Manufacturing Open (2024) Vol. 2, Iss. 1
Open Access
Modelling and Optimization of a Distributed Flow Shop Group Scheduling Problem with Heterogeneous Factories
Jingwen Zhou, Tao Meng, Yangli Jia
(2024)
Closed 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
Energy-efficient optimization for distributed blocking hybrid flowshop scheduling: a self-regulating iterative greedy algorithm under makespan constraint
Yong Wang, Yuyan Han, Yuting Wang, et al.
Optimization and Engineering (2024)
Closed Access
A Hybrid Multi-Threaded Parallel Iterated Greedy Algorithm for Distributed Flowshop Group Scheduling Problems with Preventive Maintenance
Xiaobin Sun, Hongyan Sang, Yasheng Zhao, et al.
(2024), pp. 117-121
Closed Access
A single-individual based variable neighborhood search algorithm for the blocking hybrid flow shop group scheduling problem
Zhongyuan Peng, Haoxiang Qin
Egyptian Informatics Journal (2024) Vol. 27, pp. 100509-100509
Open Access
An accelerated discrete artificial bee colony algorithm under the makespan constraint: Solving the distributed blocking flow shop scheduling problem with balanced energy consumption costs
Chunyue ZHANG, Yuyan Han, Yuting Wang, et al.
Expert Systems with Applications (2024), pp. 125374-125374
Closed Access
Transportation and delivery in flow-shop scheduling problems: A systematic review
Victor Fernández-Viagas
European Journal of Operational Research (2024)
Open Access
A speed-up procedure and new heuristics for the classical job shop scheduling problem: A computational evaluation
Victor Fernández-Viagas, Carla Talens, Bruno de Athayde Prata
European Journal of Operational Research (2024)
Closed Access
A Self-adaptive two stage iterative greedy algorithm based job scales for energy-efficient distributed permutation flowshop scheduling problem
Yang Yu, Quan Zhong, Liangliang Sun, et al.
Swarm and Evolutionary Computation (2024) Vol. 92, pp. 101777-101777
Closed Access
A Novel Multi-Objective Hybrid Evolutionary Algorithm Based on Variable Weight Strategy for Distributed Hybrid Flowshop Scheduling with Batch Processing Machines and Variable Sublots
Chengshuai Li, Yuyan Han, Biao Zhang, et al.
Applied Soft Computing (2024), pp. 112650-112650
Closed Access
Previous Page - Page 2

Scroll to top