Quan-Ke Pan

1.0k total citations
40 papers, 763 citations indexed

About

Quan-Ke Pan is a scholar working on Industrial and Manufacturing Engineering, Control and Systems Engineering and Computer Networks and Communications. According to data from OpenAlex, Quan-Ke Pan has authored 40 papers receiving a total of 763 indexed citations (citations by other indexed papers that have themselves been cited), including 36 papers in Industrial and Manufacturing Engineering, 6 papers in Control and Systems Engineering and 5 papers in Computer Networks and Communications. Recurrent topics in Quan-Ke Pan's work include Scheduling and Optimization Algorithms (31 papers), Advanced Manufacturing and Logistics Optimization (31 papers) and Assembly Line Balancing Optimization (18 papers). Quan-Ke Pan is often cited by papers focused on Scheduling and Optimization Algorithms (31 papers), Advanced Manufacturing and Logistics Optimization (31 papers) and Assembly Line Balancing Optimization (18 papers). Quan-Ke Pan collaborates with scholars based in China, Spain and Australia. Quan-Ke Pan's co-authors include Liang Gao, Hongyan Sang, Yuyan Han, Yiping Liu, Junqing Li, Haoxiang Qin, Rubén Ruíz, Biao Zhang, Zhonghua Miao and Yuanzhen Li and has published in prestigious journals such as SHILAP Revista de lepidopterología, European Journal of Operational Research and Expert Systems with Applications.

In The Last Decade

Quan-Ke Pan

37 papers receiving 742 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Quan-Ke Pan China 15 626 124 117 92 47 40 763
Rong Hu China 12 426 0.7× 83 0.7× 133 1.1× 85 0.9× 18 0.4× 56 555
Zixiao Pan China 12 585 0.9× 77 0.6× 164 1.4× 105 1.1× 26 0.6× 24 755
Tianhua Jiang China 16 513 0.8× 87 0.7× 169 1.4× 75 0.8× 15 0.3× 41 677
Mohammad Amin Adibi Iran 9 455 0.7× 76 0.6× 94 0.8× 88 1.0× 13 0.3× 22 588
Francisco Ángel-Bello Mexico 16 521 0.8× 73 0.6× 86 0.7× 71 0.8× 21 0.4× 28 630
Guanlong Deng China 13 399 0.6× 62 0.5× 121 1.0× 87 0.9× 56 1.2× 30 566
Lenz Belzner Germany 7 444 0.7× 72 0.6× 112 1.0× 89 1.0× 10 0.2× 29 620
Kunkun Peng China 13 689 1.1× 55 0.4× 115 1.0× 128 1.4× 13 0.3× 27 827
Christophe Wilbaut France 14 338 0.5× 135 1.1× 107 0.9× 36 0.4× 21 0.4× 25 457
Xiuping Guo China 14 568 0.9× 66 0.5× 119 1.0× 78 0.8× 9 0.2× 29 663

Countries citing papers authored by Quan-Ke Pan

Since Specialization
Citations

This map shows the geographic impact of Quan-Ke Pan's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Quan-Ke Pan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Quan-Ke Pan more than expected).

Fields of papers citing papers by Quan-Ke Pan

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Quan-Ke Pan. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Quan-Ke Pan. The network helps show where Quan-Ke Pan may publish in the future.

Co-authorship network of co-authors of Quan-Ke Pan

This figure shows the co-authorship network connecting the top 25 collaborators of Quan-Ke Pan. A scholar is included among the top collaborators of Quan-Ke Pan based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Quan-Ke Pan. Quan-Ke Pan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Liu, Zi‐Jiang, Hongyan Sang, Quan-Ke Pan, & Ling Wang. (2025). A bi-cooperative parallel evolutionary algorithm for co-scheduling of distributed production and distribution considering shared transportation resources. Computers & Operations Research. 183. 107157–107157. 1 indexed citations
2.
Qin, Haoxiang, Yi Xiang, Yuyan Han, et al.. (2025). A knowledge region selection enhanced quality-diversity algorithm for real-world flexible job shop scheduling with Automated Guided Vehicles transportation. Engineering Applications of Artificial Intelligence. 164. 113352–113352.
3.
Pan, Quan-Ke, et al.. (2025). A novel elite-preserving iterated greedy algorithm with Q-learning for cascaded flowshop joint scheduling problem. Expert Systems with Applications. 297. 129512–129512.
4.
Pan, Quan-Ke, et al.. (2025). A Q-learning-assisted memetic algorithm for joint vehicle scheduling problem for harvesting and transportation in smart agriculture. Swarm and Evolutionary Computation. 96. 102007–102007.
5.
Li, Qiuying, Quan-Ke Pan, Liang Gao, et al.. (2024). The constrained permutation flowshop problem: An effective two-stage iterated greedy algorithm to minimize weighted tardiness. Swarm and Evolutionary Computation. 91. 101696–101696. 4 indexed citations
6.
Miao, Zhonghua, et al.. (2024). Hybrid loading situation vehicle routing problem in the context of agricultural harvesting: A reconstructed MOEA/D with parallel populations. Swarm and Evolutionary Computation. 91. 101730–101730. 4 indexed citations
7.
Wang, Yuting, Yuyan Han, Huan Li, Quan-Ke Pan, & Dunwei Gong. (2024). Theoretical analysis and methods of rapid evaluation: Solving the blocking flowshop group scheduling problem with the total flow time and total tardiness time criteria. Swarm and Evolutionary Computation. 88. 101604–101604. 3 indexed citations
8.
Miao, Zhonghua, et al.. (2024). A learning-based memetic algorithm for a cooperative task allocation problem of multiple unmanned aerial vehicles in smart agriculture. Swarm and Evolutionary Computation. 91. 101694–101694. 6 indexed citations
9.
Sang, Hongyan, et al.. (2024). An efficient collaborative multi-swap iterated greedy algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance. Swarm and Evolutionary Computation. 86. 101537–101537. 13 indexed citations
10.
Pan, Quan-Ke, et al.. (2024). An effective multi-objective evolutionary algorithm for multiple spraying robots task assignment problem. Swarm and Evolutionary Computation. 87. 101558–101558. 14 indexed citations
11.
Han, Yuyan, Yuting Wang, Quan-Ke Pan, Ling Wang, & M. Fatih Tasgetiren. (2024). Accelerated evaluation of blocking flowshop scheduling with total flow time criteria using a generalized critical machine-based approach. European Journal of Operational Research. 318(2). 424–441. 4 indexed citations
12.
Wang, Yuting, et al.. (2023). Redefining hybrid flow shop group scheduling: Unveiling a novel hybrid modeling paradigm and assessing 48 MILP and CP models. Swarm and Evolutionary Computation. 83. 101416–101416. 10 indexed citations
13.
Pan, Quan-Ke, et al.. (2023). A collaborative iterated greedy algorithm with reinforcement learning for energy-aware distributed blocking flow-shop scheduling. Swarm and Evolutionary Computation. 83. 101399–101399. 25 indexed citations
14.
He, Xuan, Quan-Ke Pan, Liang Gao, & Janis S. Neufeld. (2023). An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem. European Journal of Operational Research. 310(2). 597–610. 24 indexed citations
15.
16.
Pan, Quan-Ke, et al.. (2023). A Multi-Robot Task Allocation and Path Planning Method for the Robotic Mobile Fulfillment System. 1720–1725. 1 indexed citations
17.
Li, Yuanzhen, et al.. (2022). The distributed flowshop scheduling problem with delivery dates and cumulative payoffs. Computers & Industrial Engineering. 165. 107961–107961. 16 indexed citations
18.
Li, Yuanzhen, Quan-Ke Pan, Rubén Ruíz, & Hongyan Sang. (2021). A referenced iterated greedy algorithm for the distributed assembly mixed no-idle permutation flowshop scheduling problem with the total tardiness criterion. Knowledge-Based Systems. 239. 108036–108036. 47 indexed citations
19.
Pan, Quan-Ke. (2010). An Algorithm Based on Discrete Shuffled Frog Leaping for No_ Idle Permutation Flow Shop Scheduling Problem. Journal of Beijing University of Technology. 3 indexed citations
20.
Gao, Kaizhou, et al.. (2010). A harmony search algorithm for the no-wait flow shop optimization scheduling. Chinese Control Conference. 1723–1726. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Rong Hu Breakdown of academic impact, for papers by Zixiao Pan Breakdown of academic impact, for papers by Tianhua Jiang Breakdown of academic impact, for papers by Mohammad Amin Adibi Breakdown of academic impact, for papers by Francisco Ángel-Bello Breakdown of academic impact, for papers by Guanlong Deng Breakdown of academic impact, for papers by Lenz Belzner Breakdown of academic impact, for papers by Kunkun Peng Breakdown of academic impact, for papers by Christophe Wilbaut Breakdown of academic impact, for papers by Xiuping Guo
Rankless by CCL
2026