Quan-Ke Pan

Artificial Intelligence · 2007–2019

A researcher in the Science corpus: 12 papers; trusts 23 researchers and is trusted by 9 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 45 citations into it; #13,245 of 35,345 by trust here, #12,387 by citations
• Industrial and Manufacturing Engineering — 41 citations into it; #1,362 of 2,521 by trust here, #896 by citations
• Computational Theory and Mathematics — 27 citations into it; #4,375 of 12,182 by trust here, #3,033 by citations
• Computer Networks and Communications — 15 citations into it
• Civil and Structural Engineering — 8 citations into it
• Control and Systems Engineering — 6 citations into it; #7,673 of 8,257 by trust here, #7,140 by citations
• Statistics and Probability — 6 citations into it
• Electrical and Electronic Engineering — 5 citations into it

Whom Quan-Ke Pan trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Rubén Ruiz
2. Mehmet Fatih Tasgetiren
3. Godfrey C. Onwubolu
4. Luiz Paulo Lopes Fávero
5. Eric R. Ziegel
6. Mohammad Ali Abido
7. Yun-Chia Liang
8. Thomas Stützle
9. R. Eberhart
10. Chandrasekharan Rajendran

Who trusts Quan-Ke Pan overall

1. James Jian Qiao Yu
2. Rubén Ruiz
3. Varun Ojha
4. Fei Kang
5. Yu-yan Han
6. Ryoji Tanabe
7. Victor O. K. Li
8. Swagatam Das
9. Pinar Çivicioglu
10. Ajith Abraham

Papers from Quan-Ke Pan's perspective

Ordered by how strongly the researchers Quan-Ke Pan trusts endorse each paper. Same corpus, a different order for every researcher.

1. A genetic algorithm for flowshop sequencing
2. A new optimizer using particle swarm theory
3. A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion (Computers & Operations Research)
4. TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM
5. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs (European Journal of Operational Research)
6. Design and Analysis of Experiments
7. Genetic Algorithms in Search Optimization and Machine Learning
8. Metaheuristics - the metaphor exposed (International Transactions in Operational Research)
9. Experimental Methods for the Analysis of Optimization Algorithms
10. The distributed permutation flowshop scheduling problem (Computers & Operations Research)

Their papers

• Differential evolution algorithm with ensemble of parameters and mutation strategies (2011) — 1,324 citations
• A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem (2011) — 611 citations
• A self-adaptive global best harmony search algorithm for continuous optimization problems (2010) — 378 citations
• Iterated Greedy methods for the distributed permutation flowshop scheduling problem (2019) — 375 citations
• A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems (2019) — 458 citations
• An improved NSGA-II algorithm for multi-objective lot-streaming flow shop scheduling problem (2014) — 78 citations
• A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime (2013) — 437 citations
• Effective heuristics for the blocking flowshop scheduling problem with makespan minimization (2012) — 118 citations
• Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion (2011) — 97 citations
• A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem (2008) — 468 citations
• An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion (2008) — 122 citations
• A discrete differential evolution algorithm for the permutation flowshop scheduling problem (2007) — 313 citations