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:

A cooperative iterated greedy algorithm for the serial distributed permutation flowshop scheduling problem
Biao Han, Quan-Ke Pan, Liang Gao
International Journal of Production Research (2023) Vol. 62, Iss. 12, pp. 4245-4272
Closed Access | Times Cited: 10

Showing 10 citing articles:

Flexible assembly job shop scheduling problem considering reconfigurable machine: a cooperative co-evolutionary matheuristic algorithm
Yifan Hu, Liping Zhang, Zikai Zhang, et al.
Applied Soft Computing (2024) Vol. 166, pp. 112148-112148
Closed Access | Times Cited: 5
An effective adaptive iterated greedy algorithm for a cascaded flowshop joint scheduling problem
Chuang Wang, Quan-Ke Pan, Xue-Lei Jing
Expert Systems with Applications (2023) Vol. 238, pp. 121856-121856
Closed Access | Times Cited: 11
Joint scheduling of AGVs and parallel machines in an automated electrode foil production factory
Mengxi Tian, Hongyan Sang, Wen-Qiang Zou, et al.
Expert Systems with Applications (2023) Vol. 238, pp. 122197-122197
Closed Access | Times Cited: 11
Minimising Makespan and Total Tardiness for the Flowshop Group Scheduling Problem with Sequence Dependent Setup Times
Xuan He, Quan-Ke Pan, Liang Gao, et al.
European Journal of Operational Research (2025)
Closed Access
Logic-based Benders decomposition methods for the distributed permutation flow shop scheduling problem with production and transportation cost
Fuli Xiong, J. Y. Shi, Lin Jing, et al.
Computers & Operations Research (2025), pp. 107044-107044
Closed Access
Hybrid flow shop scheduling with continuous processing and resource threshold constraints: A case of steel plant
Zhangsheng Su, Chao Deng, Raymond Chiong, et al.
Expert Systems with Applications (2025), pp. 127247-127247
Closed Access
Order acceptance and scheduling under eligibility, availability, and budget constraints in distributed heterogeneous flow shop production
Fuli Xiong, Lin Jing, Chun Xiang, et al.
Expert Systems with Applications (2025), pp. 127586-127586
Closed Access
Minimising makespan in distributed assembly hybrid flowshop scheduling problems
Kuo‐Ching Ying, Shih-Wei Lin, Kuan‐Fu Chen
International Journal of Production Research (2024), pp. 1-18
Closed Access | Times Cited: 1
The distributed flow shop scheduling problem with inter-factory transportation
Tristan Becker, Janis S. Neufeld, Udo Buscher
European Journal of Operational Research (2024) Vol. 322, Iss. 1, pp. 39-55
Open Access | Times Cited: 1
A cascaded flowshop joint scheduling problem with makespan minimization: A mathematical model and shifting iterated greedy algorithm
Chuang Wang, Quan-Ke Pan, Hongyan Sang, et al.
Swarm and Evolutionary Computation (2024) Vol. 86, pp. 101489-101489
Closed Access
Page 1

Scroll to top