Q
Quan-Ke Pan
Researcher at Shanghai University
Publications - 304
Citations - 15638
Quan-Ke Pan is an academic researcher from Shanghai University. The author has contributed to research in topics: Job shop scheduling & Local search (optimization). The author has an hindex of 62, co-authored 281 publications receiving 12128 citations. Previous affiliations of Quan-Ke Pan include Liaocheng University & Huazhong University of Science and Technology.
Papers
More filters
Journal ArticleDOI
Differential evolution algorithm with ensemble of parameters and mutation strategies
TL;DR: The performance of EPSDE is evaluated on a set of bound-constrained problems and is compared with conventional DE and several state-of-the-art parameter adaptive DE variants.
Journal ArticleDOI
A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem
TL;DR: A discrete artificial bee colony algorithm is proposed to solve the lot-streaming flow shop scheduling problem with the criterion of total weighted earliness and tardiness penalties under both the idling and no-idling cases.
Journal ArticleDOI
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
TL;DR: A discrete particle swarm optimization (DPSO) algorithm is presented to solve the no-wait flowshop scheduling problem with both makespan and total flowtime criteria and a new position update method is developed based on the discrete domain.
Journal ArticleDOI
A self-adaptive global best harmony search algorithm for continuous optimization problems
TL;DR: In the proposed SGHS algorithm, a new improvisation scheme is developed so that the good information captured in the current global best solution can be well utilized to generate new harmonies.
Journal ArticleDOI
A discrete differential evolution algorithm for the permutation flowshop scheduling problem
TL;DR: In this paper, the authors proposed an iterated greedy algorithm for the permutation flowshop scheduling problem with the makespan criterion and a referenced local search procedure to further improve the solution quality.