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
Proceedings ArticleDOI
Improvement of Grayscale Image Segmentation Based on PSO Algorithm
TL;DR: An improved 2D entropy segmentation method is proposed, called PSO-SDAIVE algorithm, which can quickly and accurately obtain segmentation threshold and has strong anti-noise capability and saves computation time.
Journal ArticleDOI
An Effective Multi-Objective Artificial Bee Colony Algorithm for Energy Efficient Distributed Job Shop Scheduling
TL;DR: The experimental result demonstrates that the proposed MOABC can generate better Pareto solutions than NSGA-II and SPEA2 for the DJSSP.
Journal ArticleDOI
A novel Lagrangian relaxation level approach for scheduling steelmaking-refining-continuous casting production
TL;DR: In this article, a Lagrangian relaxation (LR) approach was presented which is with machine capacity relaxation and operation precedence relaxation for solving a flexible job shop (FJS) scheduling problem from the steelmaking refining continuous casting process.
Journal ArticleDOI
Differential evolution algorithm-based range image registration for free-form surface parts quality inspection
TL;DR: This paper presents a design model-based inspection method with range image registration, in which the measurement model is represented by a series of 3D discrete points, and a differential evolution algorithm-based optimizer is proposed for error evaluation.
Proceedings ArticleDOI
A populated local search with differential evolution for blocking flowshop scheduling problem
TL;DR: This paper presents a populated local search algorithm through a differential evolution algorithm for solving the blocking flowshop scheduling problem under makespan criterion and presents the greedy randomized adaptive search procedure (GRASP) for the problem on hand.