Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQuan-Ke Pan
Quanke Pan
Person information
- affiliation: Huazhong University of Science and Technology, State Key Laboratory of Digital Manufacturing Equipment and Technology, Wuhan, China
- affiliation: Shanghai UniversitySchool of Mechatronic Engineering and Automation, China
- affiliation: Liaocheng University, College of Computer Science, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j160]Chuang Wang
, Quan-Ke Pan, Xue-Lei Jing:
An effective adaptive iterated greedy algorithm for a cascaded flowshop joint scheduling problem. Expert Syst. Appl. 238(Part A): 121856 (2024)- [j159]Jingchao Wang, Weimin Li, Fangfang Liu, Zhenhai Wang, Alex Munyole Luvembe, Qun Jin, Quanke Pan, Fangyu Liu:
ConeE: Global and local context-enhanced embedding for inductive knowledge graph completion. Expert Syst. Appl. 246: 123116 (2024) - [j158]Qiu-Ying Li, Quan-Ke Pan, Hongyan Sang, Xue-Lei Jing, Jose M. Framiñan, Wei-Min Li:
Self-Adaptive Population-Based Iterated Greedy Algorithm for Distributed Permutation Flowshop Scheduling Problem with Part of Jobs Subject to a Common Deadline Constraint. Expert Syst. Appl. 248: 123278 (2024) - [j157]Biao Han, Quan-Ke Pan, Liang Gao:
A cooperative iterated greedy algorithm for the serial distributed permutation flowshop scheduling problem. Int. J. Prod. Res. 62(12): 4245-4272 (2024) - [j156]Wen-Qiang Zou, Jiazhen Zou, Hongyan Sang, Leilei Meng, Quanke Pan:
An effective population-based iterated greedy algorithm for solving the multi-AGV scheduling problem with unloading safety detection. Inf. Sci. 657: 119949 (2024) - [j155]Hengwei Guo, Zhonghua Miao, Jc Ji, Quanke Pan:
An effective collaboration evolutionary algorithm for multi-robot task allocation and scheduling in a smart farm. Knowl. Based Syst. 289: 111474 (2024) - [j154]Chuang Wang, Quan-Ke Pan, Hongyan Sang:
The cascaded flowshop joint scheduling problem: A mathematical model and population-based iterated greedy algorithm to minimize total tardiness. Robotics Comput. Integr. Manuf. 88: 102747 (2024) - [j153]Chuang Wang, Quan-Ke Pan, Hong-yan Sang, Xue-Lei Jing:
A cascaded flowshop joint scheduling problem with makespan minimization: A mathematical model and shifting iterated greedy algorithm. Swarm Evol. Comput. 86: 101489 (2024) - [j152]Qiu-Yang Han, Hong-yan Sang, Quan-Ke Pan, Biao Zhang, Heng-Wei Guo:
An efficient collaborative multi-swap iterated greedy algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance. Swarm Evol. Comput. 86: 101537 (2024) - [j151]Jin-Shuai Dong, Quan-Ke Pan, Zhong-Hua Miao, Hong-yan Sang, Liang Gao:
An effective multi-objective evolutionary algorithm for multiple spraying robots task assignment problem. Swarm Evol. Comput. 87: 101558 (2024) - [j150]Cun-Hai Wang, Quan-Ke Pan, Xiao-Ping Li, Hong-yan Sang, Bing Wang:
A multi-objective teaching-learning-based optimizer for a cooperative task allocation problem of weeding robots and spraying drones. Swarm Evol. Comput. 87: 101565 (2024) - [j149]Lou-Lei Dai, Quan-Ke Pan, Zhong-Hua Miao, Ponnuthurai Nagaratnam Suganthan, Kai-Zhou Gao:
Multi-Objective Multi-Picking-Robot Task Allocation: Mathematical Model and Discrete Artificial Bee Colony Algorithm. IEEE Trans. Intell. Transp. Syst. 25(6): 6061-6073 (2024) - 2023
- [j148]Mei-Chen Yang, Quan-Ke Pan, Hongyan Sang, Weimin Li, Yu-Long Wang:
A slack speed-up based discrete artificial bee colony algorithm for resource-constrained operating room scheduling problem. Comput. Ind. Eng. 186: 109760 (2023) - [j147]Hui Zhao, Quan-Ke Pan, Kai-Zhou Gao:
A cooperative population-based iterated greedy algorithm for distributed permutation flowshop group scheduling problem. Eng. Appl. Artif. Intell. 125: 106750 (2023) - [j146]Xuan He, Quan-Ke Pan, Liang Gao, Janis S. Neufeld:
An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem. Eur. J. Oper. Res. 310(2): 597-610 (2023) - [j145]Wen-Qiang Zou, Quan-Ke Pan, Leilei Meng, Hong-yan Sang, Yu-yan Han, Junqing Li:
An effective self-adaptive iterated greedy algorithm for a multi-AGVs scheduling problem with charging and maintenance. Expert Syst. Appl. 216: 119512 (2023) - [j144]Biao Zhang, Quan-Ke Pan, Leilei Meng, Xinli Zhang, Xu-Chu Jiang:
A decomposition-based multi-objective evolutionary algorithm for hybrid flowshop rescheduling problem with consistent sublots. Int. J. Prod. Res. 61(3): 1013-1038 (2023) - [j143]Ying-Ying Huang, Quan-Ke Pan, Liang Gao:
An effective memetic algorithm for the distributed flowshop scheduling problem with an assemble machine. Int. J. Prod. Res. 61(6): 1755-1770 (2023) - [j142]Xin-Rui Tao, Quan-Ke Pan, Hongyan Sang, Liang Gao, Aolei Yang, Miao Rong:
Nondominated sorting genetic algorithm-II with Q-learning for the distributed permutation flowshop rescheduling problem. Knowl. Based Syst. 278: 110880 (2023) - [j141]Shuai Chen, Quan-Ke Pan, Liang Gao, Zhong-Hua Miao, Chen Peng:
Energy-efficient distributed heterogeneous blocking flowshop scheduling problem using a knowledge-based iterated Pareto greedy algorithm. Neural Comput. Appl. 35(9): 6361-6381 (2023) - [j140]Yiling Lu, Qiuhua Tang, Quanke Pan, Lianpeng Zhao, Yingying Zhu:
A Heuristic-Based Adaptive Iterated Greedy Algorithm for Lot-Streaming Hybrid Flow Shop Scheduling Problem with Consistent and Intermingled Sub-Lots. Sensors 23(5): 2808 (2023) - [j139]Zhi-Yuan Wang, Quan-Ke Pan, Liang Gao, Xue-Lei Jing, Qing Sun:
A cooperative iterated greedy algorithm for the distributed flowshop group robust scheduling problem with uncertain processing times. Swarm Evol. Comput. 79: 101320 (2023) - [j138]Haizhu Bao, Quanke Pan, Rubén Ruiz, Liang Gao:
A collaborative iterated greedy algorithm with reinforcement learning for energy-aware distributed blocking flow-shop scheduling. Swarm Evol. Comput. 83: 101399 (2023) - [j137]Yuting Wang, Yuyan Han, Quan-Ke Pan, Huan Li, Yuhang Wang:
Redefining hybrid flow shop group scheduling: Unveiling a novel hybrid modeling paradigm and assessing 48 MILP and CP models. Swarm Evol. Comput. 83: 101416 (2023) - [j136]Xuan He, Quan-Ke Pan, Liang Gao, Ling Wang, Ponnuthurai Nagaratnam Suganthan:
A Greedy Cooperative Co-Evolutionary Algorithm With Problem-Specific Knowledge for Multiobjective Flowshop Group Scheduling Problems. IEEE Trans. Evol. Comput. 27(3): 430-444 (2023) - [j135]Yu Du, Jun-qing Li, Xiao-long Chen, Peiyong Duan, Quan-Ke Pan:
Knowledge-Based Reinforcement Learning and Estimation of Distribution Algorithm for Flexible Job Shop Scheduling Problem. IEEE Trans. Emerg. Top. Comput. Intell. 7(4): 1036-1050 (2023) - [j134]Zhong-Kai Li, Hongyan Sang, Quanke Pan, Kaizhou Gao, Yuyan Han, Junqing Li:
Dynamic AGV Scheduling Model With Special Cases in Matrix Production Workshop. IEEE Trans. Ind. Informatics 19(6): 7762-7770 (2023) - [j133]Jianhui Mou, Peiyong Duan, Liang Gao, Quanke Pan, Kaizhou Gao, Amit Kumar Singh:
Biologically Inspired Machine Learning-Based Trajectory Analysis in Intelligent Dispatching Energy Storage System. IEEE Trans. Intell. Transp. Syst. 24(4): 4509-4518 (2023) - [j132]Dongdong Wang, Suying Pan, Jin Zhou, Quanke Pan, Zhonghua Miao, Jiangke Yang:
Event-Triggered Integral Formation Controller for Networked Nonholonomic Mobile Robots: Theory and Experiment. IEEE Trans. Intell. Transp. Syst. 24(12): 14620-14632 (2023) - [c65]Haizhu Bao, Quanke Pan, Miao Rong, Aolei Yang, Xiaohua Wang:
A Multi-action Reinforcement Learning Algorithm for Energy-efficiency Blocking Flow-shop Scheduling Problem. CSCWD 2023: 492-497 - 2022
- [j131]Yuanzhen Li, Quan-Ke Pan, Xuan He, Hongyan Sang, Kai-Zhou Gao, Xue-Lei Jing:
The distributed flowshop scheduling problem with delivery dates and cumulative payoffs. Comput. Ind. Eng. 165: 107961 (2022) - [j130]Xin-Rui Tao, Quan-Ke Pan, Liang Gao:
An efficient self-adaptive artificial bee colony algorithm for the distributed resource-constrained hybrid flowshop problem. Comput. Ind. Eng. 169: 108200 (2022) - [j129]Hande Öztop, Mehmet Fatih Tasgetiren, Levent Kandiller, Quan-Ke Pan:
Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion. Comput. Oper. Res. 138: 105616 (2022) - [j128]Hao-Xiang Qin, Yu-Yan Han, Yi-Ping Liu, Jun-Qing Li, Quan-Ke Pan, Xue Han:
A collaborative iterative greedy algorithm for the scheduling of distributed heterogeneous hybrid flow shop with blocking constraints. Expert Syst. Appl. 201: 117256 (2022) - [j127]Biao Zhang, Quan-Ke Pan, Leilei Meng, Chao Lu, Jianhui Mou, Junqing Li:
An automatic multi-objective evolutionary algorithm for the hybrid flowshop scheduling problem with consistent sublots. Knowl. Based Syst. 238: 107819 (2022) - [j126]Yuanzhen Li, Quan-Ke Pan, Rubén Ruiz, Hongyan Sang:
A referenced iterated greedy algorithm for the distributed assembly mixed no-idle permutation flowshop scheduling problem with the total tardiness criterion. Knowl. Based Syst. 239: 108036 (2022) - [j125]Wen-Qiang Zou, Quan-Ke Pan, Ling Wang, Zhong-Hua Miao, Chen Peng:
Efficient multiobjective optimization for an AGV energy-efficient scheduling problem with release time. Knowl. Based Syst. 242: 108334 (2022) - [j124]Jia-Yang Mao, Quan-Ke Pan, Zhong-Hua Miao, Liang Gao, Shuai Chen:
A hash map-based memetic algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance to minimize total flowtime. Knowl. Based Syst. 242: 108413 (2022) - [j123]Haoxiang Qin, Yuyan Han, Yuting Wang, Yiping Liu, Junqing Li, Quanke Pan:
Intelligent optimization under blocking constraints: A novel iterated greedy algorithm for the hybrid flow shop group scheduling problem. Knowl. Based Syst. 258: 109962 (2022) - [j122]Hao-Xiang Qin, Yu-Yan Han, Biao Zhang, Leilei Meng, Yiping Liu, Quan-Ke Pan, Dun-Wei Gong:
An improved iterated greedy algorithm for the energy-efficient blocking hybrid flow shop scheduling problem. Swarm Evol. Comput. 69: 100992 (2022) - [j121]Ying-Ying Huang, Quan-Ke Pan, Liang Gao, Zhong-Hua Miao, Chen Peng:
A two-phase evolutionary algorithm for multi-objective distributed assembly permutation flowshop scheduling problem. Swarm Evol. Comput. 74: 101128 (2022) - [j120]Danyu Bai, Xiaoyuan Bai, Haoran Li, Quan-Ke Pan, Chin-Chia Wu, Liang Gao, Meiting Guo, Lin Lin:
Blocking flowshop scheduling problems with release dates. Swarm Evol. Comput. 74: 101140 (2022) - [j119]Zhi-Yuan Wang, Quan-Ke Pan, Liang Gao, Yu-Long Wang:
An effective two-stage iterated greedy algorithm to minimize total tardiness for the distributed flowshop group scheduling problem. Swarm Evol. Comput. 74: 101143 (2022) - [j118]Jun-Qing Li, Yu Du, Kai-Zhou Gao, Pei-Yong Duan, Dun-Wei Gong, Quan-Ke Pan, Ponnuthurai N. Suganthan:
A Hybrid Iterated Greedy Algorithm for a Crane Transportation Flexible Job Shop Problem. IEEE Trans Autom. Sci. Eng. 19(3): 2153-2170 (2022) - [j117]Qing-da Chen, Jinliang Ding, Tianyou Chai, Quanke Pan:
Evolutionary Optimization Under Uncertainty: The Strategies to Handle Varied Constraints for Fluid Catalytic Cracking Operation. IEEE Trans. Cybern. 52(4): 2249-2262 (2022) - [j116]Quan-Ke Pan, Liang Gao, Ling Wang:
An Effective Cooperative Co-Evolutionary Algorithm for Distributed Flowshop Group Scheduling Problems. IEEE Trans. Cybern. 52(7): 5999-6012 (2022) - [j115]Xue-Lei Jing, Quan-Ke Pan, Liang Gao, Ling Wang:
An Effective Iterated Greedy Algorithm for a Robust Distributed Permutation Flowshop Problem With Carryover Sequence-Dependent Setup Time. IEEE Trans. Syst. Man Cybern. Syst. 52(9): 5783-5794 (2022) - [c64]Xin-Rui Tao, Bao-Jiang Wu, Quan-Ke Pan:
Discrete Artificial Bee Colony Algorithm for the Distributed Resource Constrained Hybrid Flowshop Problem. ASCC 2022: 999-1003 - 2021
- [j114]Wen-Qiang Zou, Quan-Ke Pan, Mehmet Fatih Tasgetiren:
An effective iterated greedy algorithm for solving a multi-compartment AGV scheduling problem in a matrix manufacturing workshop. Appl. Soft Comput. 99: 106945 (2021) - [j113]Xue-Lei Jing, Quan-Ke Pan, Liang Gao:
Local search-based metaheuristics for the robust distributed permutation flowshop problem. Appl. Soft Comput. 105: 107247 (2021) - [j112]Biao Zhang, Quan-Ke Pan, Leilei Meng, Xin-Li Zhang, Yaping Ren, Jun-Qing Li, Xu-Chu Jiang:
A collaborative variable neighborhood descent algorithm for the hybrid flowshop scheduling problem with consistent sublots. Appl. Soft Comput. 106: 107305 (2021) - [j111]Yuanzhen Li, Quan-Ke Pan, Kai-Zhou Gao, Mehmet Fatih Tasgetiren, Biao Zhang, Jun-Qing Li:
A green scheduling algorithm for the distributed flowshop problem. Appl. Soft Comput. 109: 107526 (2021) - [j110]Jiang-Ping Huang, Quan-Ke Pan, Liang Gao, Ling Wang:
An effective iterated greedy algorithm for PCBs grouping problem to minimize setup times. Appl. Soft Comput. 112: 107830 (2021) - [j109]Ying-Ying Huang, Quan-Ke Pan, Jiang-Ping Huang, Ponnuthurai N. Suganthan, Liang Gao:
An improved iterated greedy algorithm for the distributed assembly permutation flowshop scheduling problem. Comput. Ind. Eng. 152: 107021 (2021) - [j108]Jiang-Ping Huang, Quan-Ke Pan, Zhong-Hua Miao, Liang Gao:
Effective constructive heuristics and discrete bee colony optimization for distributed flowshop with setup times. Eng. Appl. Artif. Intell. 97: 104016 (2021) - [j107]Shuai Chen, Quan-Ke Pan, Liang Gao, Hong-yan Sang:
A population-based iterated greedy algorithm to minimize total flowtime for the distributed blocking flowshop scheduling problem. Eng. Appl. Artif. Intell. 104: 104375 (2021) - [j106]Jia-Yang Mao, Quan-Ke Pan, Zhong-Hua Miao, Liang Gao:
An effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flowshop scheduling problem with preventive maintenance. Expert Syst. Appl. 169: 114495 (2021) - [j105]Yingli Li, Xinyu Li, Liang Gao, Biao Zhang, Quan-Ke Pan, Mehmet Fatih Tasgetiren, Leilei Meng:
A discrete artificial bee colony algorithm for distributed hybrid flowshop scheduling problem with sequence-dependent setup times. Int. J. Prod. Res. 59(13): 3880-3899 (2021) - [j104]Wen-Qiang Zou, Quan-Ke Pan, Ling Wang:
An effective multi-objective evolutionary algorithm for solving the AGV scheduling problem with pickup and delivery. Knowl. Based Syst. 218: 106881 (2021) - [j103]Liang Sun, Quan-Ke Pan, Xue-Lei Jing, Jiang-Ping Huang:
A light-robust-optimization model and an effective memetic algorithm for an open vehicle routing problem under uncertain travel times. Memetic Comput. 13(2): 149-167 (2021) - [j102]Shuai Chen, Quan-Ke Pan, Liang Gao:
Production scheduling for blocking flowshop in distributed environment using effective heuristics and iterated greedy algorithm. Robotics Comput. Integr. Manuf. 71: 102155 (2021) - [j101]Tao Meng, Quan-Ke Pan:
A distributed heterogeneous permutation flowshop scheduling problem with lot-streaming and carryover sequence-dependent setup time. Swarm Evol. Comput. 60: 100804 (2021) - [j100]Xiaozhi Wang, Bing Wang, Xianxia Zhang, Xuedong Xia, Quanke Pan:
Two-objective robust job-shop scheduling with two problem-specific neighborhood structures. Swarm Evol. Comput. 61: 100805 (2021) - [j99]Yuanzhen Li, Quan-Ke Pan, Jun-Qing Li, Liang Gao, Mehmet Fatih Tasgetiren:
An Adaptive Iterated Greedy algorithm for distributed mixed no-idle permutation flowshop scheduling problems. Swarm Evol. Comput. 63: 100874 (2021) - 2020
- [j98]Wen-Qiang Zou, Quan-Ke Pan, Mehmet Fatih Tasgetiren:
An Effective Discrete Artificial Bee Colony Algorithm for Scheduling an Automatic-Guided-Vehicle in a Linear Manufacturing Workshop. IEEE Access 8: 35063-35076 (2020) - [j97]Yuyan Han, Junqing Li, Hongyan Sang, Yiping Liu, Kaizhou Gao, Quanke Pan:
Discrete evolutionary multi-objective optimization for energy-efficient blocking flow shop scheduling with setup time. Appl. Soft Comput. 93: 106343 (2020) - [j96]Xue-Lei Jing, Quan-Ke Pan, Liang Gao, Yu-Long Wang:
An effective Iterated Greedy algorithm for the distributed permutation flowshop scheduling with due windows. Appl. Soft Comput. 96: 106629 (2020) - [j95]Hande Öztop, Mehmet Fatih Tasgetiren, Deniz Türsel Eliiyi, Quan-Ke Pan, Levent Kandiller:
An energy-efficient permutation flowshop scheduling problem. Expert Syst. Appl. 150: 113279 (2020) - [j94]Wen-Qiang Zou, Quan-Ke Pan, Tao Meng, Liang Gao, Yu-Long Wang:
An effective discrete artificial bee colony algorithm for multi-AGVs dispatching problem in a matrix manufacturing workshop. Expert Syst. Appl. 161: 113675 (2020) - [j93]Jiang-Ping Huang, Quan-Ke Pan, Liang Gao:
An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times. Swarm Evol. Comput. 59: 100742 (2020) - [j92]Jun-Qing Li, Mei-xian Song, Ling Wang, Pei-Yong Duan, Yu-Yan Han, Hong-yan Sang, Quan-Ke Pan:
Hybrid Artificial Bee Colony Algorithm for a Parallel Batching Distributed Flow-Shop Problem With Deteriorating Jobs. IEEE Trans. Cybern. 50(6): 2425-2439 (2020) - [j91]Biao Zhang, Quan-Ke Pan, Liang Gao, Leilei Meng, Xinyu Li, Kunkun Peng:
A Three-Stage Multiobjective Approach Based on Decomposition for an Energy-Efficient Hybrid Flow Shop Scheduling Problem. IEEE Trans. Syst. Man Cybern. Syst. 50(12): 4984-4999 (2020) - [c63]Hande Öztop, Mehmet Fatih Tasgetiren, Levent Kandiller, Quan-Ke Pan:
A Novel General Variable Neighborhood Search through Q-Learning for No-Idle Flowshop Scheduling. CEC 2020: 1-8 - [c62]Damla Yüksel, Mehmet Fatih Tasgetiren, Levent Kandiller, Quan-Ke Pan:
Metaheuristics for Energy-Efficient No-Wait Flowshops: A Trade-off Between Makespan and Total Energy Consumption. CEC 2020: 1-8
2010 – 2019
- 2019
- [j90]Yanan Song, Liang Gao, Xinyu Li, Quan-Ke Pan:
An Effective Encoding Method Based on Local Information for 3D Point Cloud Classification. IEEE Access 7: 39369-39377 (2019) - [j89]Damla Kizilay, Mehmet Fatih Tasgetiren, Quan-Ke Pan, Liang Gao:
A Variable Block Insertion Heuristic for Solving Permutation Flow Shop Scheduling Problem with Makespan Criterion. Algorithms 12(5): 100 (2019) - [j88]Chao Lu, Liang Gao, Quan-Ke Pan, Xinyu Li, Jun Zheng:
A multi-objective cellular grey wolf optimizer for hybrid flowshop scheduling problem considering noise pollution. Appl. Soft Comput. 75: 728-749 (2019) - [j87]Quan-Ke Pan, Liang Gao, Xinyu Li, Jose M. Framiñan:
Effective constructive heuristics and meta-heuristics for the distributed assembly permutation flowshop scheduling problem. Appl. Soft Comput. 81 (2019) - [j86]Yanan Song, Quan-Ke Pan, Liang Gao, Biao Zhang:
Improved non-maximum suppression for object detection using harmony search algorithm. Appl. Soft Comput. 81 (2019) - [j85]Biao Zhang, Quan-Ke Pan, Liang Gao, Xinyu Li, Leilei Meng, Kunkun Peng:
A multiobjective evolutionary algorithm based on decomposition for hybrid flowshop green scheduling problem. Comput. Ind. Eng. 136: 325-344 (2019) - [j84]Hande Öztop, Mehmet Fatih Tasgetiren, Deniz Türsel Eliiyi, Quan-Ke Pan:
Metaheuristic algorithms for the hybrid flowshop scheduling problem. Comput. Oper. Res. 111: 177-196 (2019) - [j83]Quan-Ke Pan, Liang Gao, Ling Wang, Jing Liang, Xinyu Li:
Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem. Expert Syst. Appl. 124: 309-324 (2019) - [j82]Kaizhou Gao, Zhiguang Cao, Le Zhang, Zhenghua Chen, Yuyan Han, Quanke Pan:
A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems. IEEE CAA J. Autom. Sinica 6(4): 904-916 (2019) - [j81]Junqing Li, Hongyan Sang, Quanke Pan, Peiyong Duan, Kaizhou Gao:
Solving multi-area environmental/ economic dispatch by Pareto-based chemical-reaction optimization algorithm. IEEE CAA J. Autom. Sinica 6(5): 1240-1250 (2019) - [j80]Tao Meng, Quan-Ke Pan, Ling Wang:
A distributed permutation flowshop scheduling problem with the customer order constraint. Knowl. Based Syst. 184 (2019) - [j79]Hongyan Sang, Quan-Ke Pan, Peiyong Duan:
Self-adaptive fruit fly optimizer for global optimization. Nat. Comput. 18(4): 785-813 (2019) - [j78]Biao Zhang, Quan-Ke Pan, Liang Gao, Xin-Li Zhang, Kunkun Peng:
A multi-objective migrating birds optimization algorithm for the hybrid flowshop rescheduling problem. Soft Comput. 23(17): 8101-8129 (2019) - [j77]Hongyan Sang, Quan-Ke Pan, Jun-Qing Li, Ping Wang, Yu-Yan Han, Kai-Zhou Gao, Peng Duan:
Effective invasive weed optimization algorithms for distributed assembly permutation flowshop problem with total flowtime criterion. Swarm Evol. Comput. 44: 64-73 (2019) - [j76]Kunkun Peng, Quan-Ke Pan, Liang Gao, Xinyu Li, Swagatam Das, Biao Zhang:
A multi-start variable neighbourhood descent algorithm for hybrid flowshop rescheduling. Swarm Evol. Comput. 45: 92-112 (2019) - [j75]Qing-da Chen, Quan-Ke Pan, Biao Zhang, Jinliang Ding, Junqing Li:
Effective Hot Rolling Batch Scheduling Algorithms in Compact Strip Production. IEEE Trans Autom. Sci. Eng. 16(4): 1933-1951 (2019) - [j74]Yuyan Han, Dunwei Gong, Yaochu Jin, Quan-Ke Pan:
Evolutionary Multiobjective Blocking Lot-Streaming Flow Shop Scheduling With Machine Breakdowns. IEEE Trans. Cybern. 49(1): 184-197 (2019) - [j73]Kaizhou Gao, Fajun Yang, MengChu Zhou, Quan-Ke Pan, Ponnuthurai Nagaratnam Suganthan:
Flexible Job-Shop Rescheduling for New Job Insertion by Using Discrete Jaya Algorithm. IEEE Trans. Cybern. 49(5): 1944-1955 (2019) - [j72]Xinyu Li, Liang Gao, Quan-Ke Pan, Liang Wan, Kuo-Ming Chao:
An Effective Hybrid Genetic Algorithm and Variable Neighborhood Search for Integrated Process Planning and Scheduling in a Packaging Machine Workshop. IEEE Trans. Syst. Man Cybern. Syst. 49(10): 1933-1945 (2019) - [c61]Kunkun Peng, Quan-Ke Pan, Ling Wang, Xudong Deng, Congbo Li, Liang Gao:
Iterated Local Search for Steelmaking-refining-Continuous Casting Scheduling Problem. CASE 2019: 567-572 - 2018
- [j71]Bing Wang, Xiaozhi Wang, Fengming Lan, Quan-Ke Pan:
A hybrid local-search algorithm for robust job-shop scheduling under scenarios. Appl. Soft Comput. 62: 259-271 (2018) - [j70]TaiFeng Li, Liang Gao, Quan-Ke Pan, Peigen Li:
Free-form surface parts quality inspection optimization with a novel sampling method. Appl. Soft Comput. 62: 550-570 (2018) - [j69]Biao Zhang, Quan-Ke Pan, Liang Gao, Xin-Li Zhang, Qing-da Chen:
A hybrid variable neighborhood search algorithm for the hot rolling batch scheduling problem in compact strip production. Comput. Ind. Eng. 116: 22-36 (2018) - [j68]Kunkun Peng, Quan-Ke Pan, Liang Gao, Biao Zhang, Xinfu Pang:
An Improved Artificial Bee Colony algorithm for real-world hybrid flowshop rescheduling in Steelmaking-refining-Continuous Casting process. Comput. Ind. Eng. 122: 235-250 (2018) - [j67]Tao Meng, Quan-Ke Pan, Hongyan Sang:
A hybrid artificial bee colony algorithm for a flexible job shop scheduling problem with overlapping in operations. Int. J. Prod. Res. 56(16): 5278-5292 (2018) - [j66]Hongyan Sang, Quan-Ke Pan, Pei-Yong Duan, Jun-Qing Li:
An effective discrete invasive weed optimization algorithm for lot-streaming flowshop scheduling problems. J. Intell. Manuf. 29(6): 1337-1349 (2018) - [j65]Tao Meng, Quan-Ke Pan, Jun-Qing Li, Hongyan Sang:
An improved migrating birds optimization for an integrated lot-streaming flow shop scheduling problem. Swarm Evol. Comput. 38: 64-78 (2018) - [c60]Mehmet Fatih Tasgetiren, Ugur Eliiyi, Hande Öztop, Damla Kizilay, Quan-Ke Pan:
An energy-efficient single machine scheduling with release dates and sequence-dependent setup times. GECCO (Companion) 2018: 145-146 - [c59]Hande Öztop, Mehmet Fatih Tasgetiren, Deniz Türsel Eliiyi, Quan-Ke Pan:
Iterated greedy algorithms for the hybrid flowshop scheduling with total flow time minimization. GECCO 2018: 379-385 - [c58]Mehmet Fatih Tasgetiren, Hande Öztop, Ugur Eliiyi, Deniz Türsel Eliiyi, Quan-Ke Pan:
Energy-Efficient Single Machine Total Weighted Tardiness Problem with Sequence-Dependent Setup Times. ICIC (1) 2018: 746-758 - [c57]Hande Öztop, Mehmet Fatih Tasgetiren, Deniz Türsel Eliiyi, Quan-Ke Pan:
Green Permutation Flowshop Scheduling: A Trade- off- Between Energy Consumption and Total Flow Time. ICIC (3) 2018: 753-759 - [c56]Tao Meng, Quan-Ke Pan, Qing-da Chen:
An Enhanced Migrating Birds Optimization for the Flexible Job Shop Scheduling Problem with Lot Streaming. ICIC (1) 2018: 769-779 - [c55]Jun-Hua Duan, Tao Meng, Qing-da Chen, Quan-Ke Pan:
An Effective Artificial Bee Colony for Distributed Lot-Streaming Flowshop Scheduling Problem. ICIC (3) 2018: 795-806 - 2017
- [j64]Quan-Ke Pan, Liang Gao, Xinyu Li, Kai-Zhou Gao:
Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times. Appl. Math. Comput. 303: 89-112 (2017) - [j63]Tao Meng, Quan-Ke Pan:
An improved fruit fly optimization algorithm for solving the multidimensional knapsack problem. Appl. Soft Comput. 50: 79-93 (2017) - [j62]Biao Zhang, Quan-Ke Pan, Liang Gao, Xin-Li Zhang, Hongyan Sang, Junqing Li:
An effective modified migrating birds optimization for hybrid flowshop scheduling problem with lot streaming. Appl. Soft Comput. 52: 14-27 (2017) - [j61]Jianhui Mou, Liang Gao, Xinyu Li, Quanke Pan, Jiancai Mu:
Multi-objective inverse scheduling optimization of single-machine shop system with uncertain due-dates and processing times. Clust. Comput. 20(1): 371-390 (2017) - [j60]Mehmet Fatih Tasgetiren, Damla Kizilay, Quan-Ke Pan, Ponnuthurai N. Suganthan:
Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion. Comput. Oper. Res. 77: 111-126 (2017) - [j59]Quan-Ke Pan, Rubén Ruiz, Pedro Alfaro-Fernández:
Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows. Comput. Oper. Res. 80: 50-60 (2017) - [j58]Jun-Qing Li, Ji-dong Wang, Quan-Ke Pan, Pei-Yong Duan, Hong-yan Sang, Kai-Zhou Gao, Yu Xue:
A hybrid artificial bee colony for optimizing a reverse logistics network system. Soft Comput. 21(20): 6001-6018 (2017) - [j57]TaiFeng Li, Quan-Ke Pan, Liang Gao, Peigen Li:
Differential evolution algorithm-based range image registration for free-form surface parts quality inspection. Swarm Evol. Comput. 36: 106-123 (2017) - [c54]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Damla Kizilay, Mario C. Vélez-Gallego:
A variable block insertion heuristic for permutation flowshops with makespan criterion. CEC 2017: 726-733 - [c53]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Yucel Ozturkoglu, Ozlem Koctas Cotur:
Variable block insertion heuristic for the quadratic assignment problem. CEC 2017: 1765-1770 - [c52]TaiFeng Li, Quan-Ke Pan, Liang Gao, Peigen Li:
A novel simplification method of point cloud with directed Hausdorff distance. CSCWD 2017: 469-474 - [c51]Jun-Hua Duan, Tao Meng, Quan-Ke Pan, Qing-da Chen:
An effective fruit fly optimization algorithm for the hybrid flowshop scheduling problem. ICNC-FSKD 2017: 930-934 - 2016
- [j56]Cemre Cubukcuoglu, Ioannis Chatzikonstantinou, Mehmet Fatih Tasgetiren, I. Sevil Sariyildiz, Quan-Ke Pan:
A Multi-Objective Harmony Search Algorithm for Sustainable Design of Floating Settlements. Algorithms 9(3): 51 (2016) - [j55]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Damla Kizilay, Kaizhou Gao:
A Variable Block Insertion Heuristic for the Blocking Flowshop Scheduling Problem with Total Flowtime Criterion. Algorithms 9(4): 71 (2016) - [j54]Yuyan Han, Dunwei Gong, Yaochu Jin, Quan-Ke Pan:
Evolutionary multi-objective blocking lot-streaming flow shop scheduling with interval processing time. Appl. Soft Comput. 42: 229-245 (2016) - [j53]Quan-Ke Pan:
An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling. Eur. J. Oper. Res. 250(3): 702-714 (2016) - [j52]Kai-Zhou Gao, Ponnuthurai Nagaratnam Suganthan, Quan-Ke Pan, Tay Jin Chua, Chin-Soon Chong, Tian Xiang Cai:
An improved artificial bee colony algorithm for flexible job-shop scheduling problem with fuzzy processing time. Expert Syst. Appl. 65: 52-67 (2016) - [j51]TaiFeng Li, Liang Gao, Peigen Li, Quan-Ke Pan:
An ensemble fruit fly optimization algorithm for solving range image registration to improve quality inspection of free-form surface parts. Inf. Sci. 367-368: 953-974 (2016) - [j50]Liang Gao, Quan-Ke Pan:
A shuffled multi-swarm micro-migrating birds optimizer for a multi-resource-constrained flexible job shop scheduling problem. Inf. Sci. 372: 655-676 (2016) - [j49]Kai-Zhou Gao, Ponnuthurai N. Suganthan, Quan-Ke Pan, Tay Jin Chua, Tian Xiang Cai, Chin-Soon Chong:
Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives. J. Intell. Manuf. 27(2): 363-374 (2016) - [j48]Kai-Zhou Gao, Ponnuthurai Nagaratnam Suganthan, Quan-Ke Pan, Mehmet Fatih Tasgetiren, Ali Sadollah:
Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion. Knowl. Based Syst. 109: 1-16 (2016) - [j47]Junqing Li, Quan-Ke Pan, Kun Mao:
A Hybrid Fruit Fly Optimization Algorithm for the Realistic Hybrid Flowshop Rescheduling Problem in Steelmaking Systems. IEEE Trans Autom. Sci. Eng. 13(2): 932-949 (2016) - [j46]Jun-Qing Li, Quan-Ke Pan, Pei-Yong Duan:
An Improved Artificial Bee Colony Algorithm for Solving Hybrid Flexible Flowshop With Dynamic Operation Skipping. IEEE Trans. Cybern. 46(6): 1311-1324 (2016) - [c50]Berk Ekici, Ioannis Chatzikonstantinou, I. Sevil Sariyildiz, Mehmet Fatih Tasgetiren, Quan-Ke Pan:
A multi-objective self-adaptive differential evolution algorithm for conceptual high-rise building design. CEC 2016: 2272-2279 - [c49]Cemre Cubukcuoglu, Ayca Kirimtat, Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan, Quan-Ke Pan:
Multi-objective harmony search algorithm for layout design in theatre hall acoustics. CEC 2016: 2280-2287 - [c48]Mert Paldrak, Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan, Quan-Ke Pan:
An ensemble of differential evolution algorithms with variable neighborhood search for constrained function optimization. CEC 2016: 2610-2617 - [c47]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Yucel Ozturkoglu, Angela Hsiang-Ling Chen:
A memetic algorithm with a variable block insertion heuristic for single machine total weighted tardiness problem with sequence dependent setup times. CEC 2016: 2911-2918 - [c46]Yavuz Ince, Korhan Karabulut, Mehmet Fatih Tasgetiren, Quan-Ke Pan:
A discrete artificial bee colony algorithm for the permutation flowshop scheduling problem with sequence-dependent setup times. CEC 2016: 3401-3408 - [c45]TaiFeng Li, Quan-Ke Pan, Liang Gao, Wenlong Li, Peigen Li:
Normal histogram-based fruit fly optimization algorithm for range image registration. CSCWD 2016: 357-362 - [c44]TaiFeng Li, Liang Gao, Quan-Ke Pan, Peigen Li:
Differential evolution algorithm-based range image registration with scaling parameters. ICIP 2016: 4508-4512 - 2015
- [j45]Biao Zhang, Quan-Ke Pan, Xin-Li Zhang, Pei-Yong Duan:
An effective hybrid harmony search-based algorithm for solving multidimensional knapsack problems. Appl. Soft Comput. 29: 288-297 (2015) - [j44]Kai-Zhou Gao, Ponnuthurai Nagaratnam Suganthan, Mehmet Fatih Tasgetiren, Quan-Ke Pan, Qiang Qiang Sun:
Effective ensembles of heuristics for scheduling flexible job shop problem with new job insertion. Comput. Ind. Eng. 90: 107-117 (2015) - [j43]Junqing Li, Quan-Ke Pan, Kun Mao:
A discrete teaching-learning-based optimisation algorithm for realistic flowshop rescheduling problems. Eng. Appl. Artif. Intell. 37: 279-292 (2015) - [j42]Liang Gao, Yinzhi Zhou, Xinyu Li, Quan-Ke Pan, Wenchao Yi:
Multi-objective optimization based reverse strategy with differential evolution algorithm for constrained optimization problems. Expert Syst. Appl. 42(14): 5976-5987 (2015) - [j41]Kai-Zhou Gao, Ponnuthurai Nagaratnam Suganthan, Tay Jin Chua, Chin-Soon Chong, Tian Xiang Cai, Quan-Ke Pan:
A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion. Expert Syst. Appl. 42(21): 7652-7663 (2015) - [j40]Jun-Qing Li, Quan-Ke Pan:
Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm. Inf. Sci. 316: 487-502 (2015) - [j39]Kun Mao, Quan-Ke Pan, Tianyou Chai, Peter B. Luh:
An Effective Subgradient Method for Scheduling a Steelmaking-Continuous Casting Process. IEEE Trans Autom. Sci. Eng. 12(3): 1140-1152 (2015) - [j38]Yefeng Liu, Quan-Ke Pan, Tianyou Chai:
Magnetic Material Group Furnace Problem Modeling and the Specialization of the Genetic Algorithm. IEEE Trans. Engineering Management 62(1): 51-64 (2015) - [c43]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Damla Kizilay, Gürsel A. Süer:
A populated local search with differential evolution for blocking flowshop scheduling problem. CEC 2015: 2789-2796 - [c42]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Damla Kizilay, Gürsel A. Süer:
A differential evolution algorithm with variable neighborhood search for multidimensional knapsack problem. CEC 2015: 2797-2804 - 2014
- [j37]Junqing Li, Quan-Ke Pan, Fatao Wang:
A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem. Appl. Soft Comput. 24: 63-77 (2014) - [j36]Kun Mao, Quan-Ke Pan, Xinfu Pang, Tianyou Chai:
A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process. Eur. J. Oper. Res. 236(1): 51-60 (2014) - [j35]Quan-Ke Pan, Yan Dong:
An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation. Inf. Sci. 277: 643-655 (2014) - [j34]Kai-Zhou Gao, Ponnuthurai N. Suganthan, Quan-Ke Pan, Tay Jin Chua, Tian Xiang Cai, Chin-Soon Chong:
Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling. Inf. Sci. 289: 76-90 (2014) - [j33]Quan-Ke Pan, Hongyan Sang, Jun-Hua Duan, Liang Gao:
An improved fruit fly optimization algorithm for continuous function optimization problems. Knowl. Based Syst. 62: 69-83 (2014) - [j32]Junqing Li, Quan-Ke Pan, Kun Mao, Ponnuthurai N. Suganthan:
Solving the steelmaking casting problem using an effective fruit fly optimisation algorithm. Knowl. Based Syst. 72: 28-36 (2014) - [c41]Damla Kizilay, Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ling Wang:
An iterated greedy algorithm for the hybrid flowshop problem with makespan criterion. CIPLS 2014: 16-23 - 2013
- [j31]Quan-Ke Pan, Rubén Ruiz:
A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime. Comput. Oper. Res. 40(1): 117-128 (2013) - [j30]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai N. Suganthan, Ozge Buyukdagli:
A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem. Comput. Oper. Res. 40(7): 1729-1743 (2013) - [j29]Quan-Ke Pan, Ling Wang, Kun Mao, Jin-Hui Zhao, Min Zhang:
An Effective Artificial Bee Colony Algorithm for a Real-World Hybrid Flowshop Problem in Steelmaking Process. IEEE Trans Autom. Sci. Eng. 10(2): 307-322 (2013) - [j28]Quan-Ke Pan, Ling Wang, Hong-yan Sang, Junqing Li, Min Liu:
A High Performing Memetic Algorithm for the Flowshop Scheduling Problem With Blocking. IEEE Trans Autom. Sci. Eng. 10(3): 741-756 (2013) - [c40]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai Nagaratnam Suganthan, Ikbal Ece Dizbay:
Metaheuristic algorithms for the quadratic assignment problem. CIPLS 2013: 131-137 - [c39]Kun Mao, Quan-Ke Pan, Mehmet Fatih Tasgetiren:
Lagrangian heuristic for scheduling a steelmaking-continuous casting process. CISched 2013: 68-74 - [c38]Mehmet Fatih Tasgetiren, Ozge Buyukdagli, Quan-Ke Pan, Ponnuthurai Nagaratnam Suganthan:
A General Variable Neighborhood Search Algorithm for the No-Idle Permutation Flowshop Scheduling Problem. SEMCCO (1) 2013: 24-34 - 2012
- [j27]Junqing Li, Quan-Ke Pan, Shengxian Xie:
An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems. Appl. Math. Comput. 218(18): 9353-9371 (2012) - [j26]Jing Chen, Quan-Ke Pan, Junqing Li:
Harmony search algorithm with dynamic control parameters. Appl. Math. Comput. 219(2): 592-604 (2012) - [j25]Kaizhou Gao, Quan-Ke Pan, Junqing Li, Yu-Ting Wang, Jing Liang:
A Hybrid Harmony Search Algorithm for the no-Wait Flow-shop Scheduling Problems. Asia Pac. J. Oper. Res. 29(2) (2012) - [j24]Junqing Li, Quan-Ke Pan:
Chemical-reaction optimization for flexible job-shop scheduling problems with maintenance activity. Appl. Soft Comput. 12(9): 2896-2912 (2012) - [j23]Quan-Ke Pan, Rubén Ruiz:
Local search methods for the flowshop scheduling problem with flowtime minimization. Eur. J. Oper. Res. 222(1): 31-43 (2012) - [c37]Yefeng Liu, Tianyou Chai, Si-Zhao Joe Qin, Quan-Ke Pan, Shengxiang Yang:
Improved genetic algorithm for magnetic material two-stage multi-product production scheduling: A case study. CDC 2012: 2521-2526 - [c36]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai N. Suganthan, Ozge Buyukdagli:
A Variable Iterated Greedy Algorithm with Differential Evolution for Solving No-Idle Flowshops. ICAISC (SIDE-EC) 2012: 128-135 - [c35]Junqing Li, Quan-Ke Pan, Ponnuthurai N. Suganthan, Mehmet Fatih Tasgetiren:
Solving Fuzzy Job-Shop Scheduling Problem by a Hybrid PSO Algorithm. ICAISC (SIDE-EC) 2012: 275-282 - 2011
- [j22]Rammohan Mallipeddi, Ponnuthurai N. Suganthan, Quan-Ke Pan, Mehmet Fatih Tasgetiren:
Differential evolution algorithm with ensemble of parameters and mutation strategies. Appl. Soft Comput. 11(2): 1679-1696 (2011) - [j21]Quan-Ke Pan, Ling Wang, Liang Gao:
A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers. Appl. Soft Comput. 11(8): 5270-5280 (2011) - [j20]Ling Wang, Quan-Ke Pan, Mehmet Fatih Tasgetiren:
A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem. Comput. Ind. Eng. 61(1): 76-83 (2011) - [j19]Yu-Ting Wang, Junqing Li, Kaizhou Gao, Quan-Ke Pan:
Memetic Algorithm based on Improved Inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem. Comput. Math. Appl. 62(7): 2743-2754 (2011) - [j18]Quan-Ke Pan, Ponnuthurai N. Suganthan, Ling Wang, Liang Gao, Rammohan Mallipeddi:
A differential evolution algorithm with self-adapting strategy and control parameters. Comput. Oper. Res. 38(1): 394-408 (2011) - [j17]Quan-Ke Pan, Ponnuthurai N. Suganthan, Jing J. Liang, Mehmet Fatih Tasgetiren:
A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem. Expert Syst. Appl. 38(4): 3252-3259 (2011) - [j16]Shi-Zheng Zhao, Ponnuthurai N. Suganthan, Quan-Ke Pan, Mehmet Fatih Tasgetiren:
Dynamic multi-swarm particle swarm optimizer with harmony search. Expert Syst. Appl. 38(4): 3735-3742 (2011) - [j15]Hongcheng Liu, Liang Gao, Quan-Ke Pan:
A hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problem. Expert Syst. Appl. 38(4): 4348-4360 (2011) - [j14]Junqing Li, Shengxian Xie, Quanke Pan, Song Wang:
A Hybrid Artificial Bee Colony Algorithm for Flexible Job Shop Scheduling Problems. Int. J. Comput. Commun. Control 6(2): 286-296 (2011) - [j13]Quan-Ke Pan, Ling Wang, Liang Gao, Weidong Li:
An effective hybrid discrete differential evolution algorithm for the flow shop scheduling with intermediate buffers. Inf. Sci. 181(3): 668-685 (2011) - [j12]Quan-Ke Pan, Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan, Tay Jin Chua:
A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Inf. Sci. 181(12): 2455-2468 (2011) - [j11]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai N. Suganthan, Angela Hsiang-Ling Chen:
A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops. Inf. Sci. 181(16): 3459-3475 (2011) - [c34]Junqing Li, Quan-Ke Pan, Shengxian Xie:
Flexible job shop scheduling problems by a hybrid artificial bee colony algorithm. IEEE Congress on Evolutionary Computation 2011: 78-83 - [c33]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ling Wang, Angela Hsiang-Ling Chen:
A DE Based Variable Iterated Greedy Algorithm for the No-Idle Permutation Flowshop Scheduling Problem with Total Flowtime Criterion. ICIC (2) 2011: 83-90 - [c32]Mehmet Fatih Tasgetiren, Önder Bulut, Quan-Ke Pan, Ponnuthurai Nagaratnam Suganthan:
A differential evolution algorithm for the median cycle problem. SDE 2011: 157-163 - 2010
- [j10]Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan, Quan-Ke Pan:
An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem. Appl. Math. Comput. 215(9): 3356-3368 (2010) - [j9]Quan-Ke Pan, Ponnuthurai N. Suganthan, Mehmet Fatih Tasgetiren, Jing J. Liang:
A self-adaptive global best harmony search algorithm for continuous optimization problems. Appl. Math. Comput. 216(3): 830-848 (2010) - [j8]Junqing Li, Quan-Ke Pan, Yun-Chia Liang:
An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems. Comput. Ind. Eng. 59(4): 647-662 (2010) - [j7]Junqing Li, Quan-Ke Pan, Shengxian Xie:
A hybrid variable neighborhood search algorithm for solving multi-objective flexible job shop problems. Comput. Sci. Inf. Syst. 7(4): 907-930 (2010) - [j6]Ling Wang, Quan-Ke Pan, Ponnuthurai N. Suganthan, Wenhong Wang, Ya-Min Wang:
A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems. Comput. Oper. Res. 37(3): 509-520 (2010) - [j5]Ling Wang, Quan-Ke Pan, Mehmet Fatih Tasgetiren:
Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms. Expert Syst. Appl. 37(12): 7929-7936 (2010) - [c31]Jing J. Liang, Quan-Ke Pan, Tiejun Chen:
A Dynamic Multi-swarm Particle Swarm Optimizer for blocking flow shop scheduling. BIC-TA 2010: 323-327 - [c30]Wen-Juan Ren, Quan-Ke Pan, Jing J. Liang:
An improved harmony search algorithm for multi-dimensional function optimization problem. BIC-TA 2010: 391-395 - [c29]Yu-Yan Han, Quan-Ke Pan, Jing J. Liang, Junqing Li:
A Hybrid Discrete Harmony Search Algorithm for blocking flow shop Scheduling. BIC-TA 2010: 435-438 - [c28]Wen-Juan Ren, Quan-Ke Pan, Junqing Li, Jing J. Liang:
Tabu search algorithm for solving No-idle permutation Flow Shop Scheduling Problem. BIC-TA 2010: 449-453 - [c27]Junqing Li, Quan-Ke Pan:
A hybrid Pareto-based local search for multi-objective flexible job shop scheduling problem. IEEE Congress on Evolutionary Computation 2010: 1-5 - [c26]Quan-Ke Pan, Mehmet Fatih Tasgetiren, Ponnuthurai Nagaratnam Suganthan, Yun-Chia Liang:
Solving lot-streaming flow shop scheduling problems using a discrete harmony search algorithm. IEEE Congress on Evolutionary Computation 2010: 1-6 - [c25]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai Nagaratnam Suganthan, Angela Hsiang-Ling Chen:
A discrete artificial bee colony algorithm for the permutation flow shop scheduling problem with total flowtime criterion. IEEE Congress on Evolutionary Computation 2010: 1-8 - [c24]Mehmet Fatih Tasgetiren, Ponnuthurai Nagaratnam Suganthan, Quan-Ke Pan, Rammohan Mallipeddi, Sedat Sarman:
An ensemble of differential evolution algorithms for constrained function optimization. IEEE Congress on Evolutionary Computation 2010: 1-8 - [c23]Jing Chen, Quan-Ke Pan, Huan Li:
Harmony search algorithm with dynamic subpopulations for scheduling identical parallel machines. ICNC 2010: 2369-2373 - [c22]Yu-Ting Wang, Junqing Li, Quan-Ke Pan, Jian Sun, Li-qun Ren:
Memetic algorithm based on improved inver-over operator for TSP. ICNC 2010: 2386-2389 - [c21]Jun-Hua Duan, Quan-Ke Pan, Junqing Li, Kaizhou Gao, Zhenqiang Bao:
Scheduling the blocking flow shop problem using a harmony search algorithm. ICNC 2010: 4258-4262 - [c20]Jun-Hua Duan, Quan-Ke Pan, Kaizhou Gao, Junqing Li, Zhenqiang Bao:
Scheduling the lot-streaming flow shop problem using a shuffled frog-leaping algorithm. ICNC 2010: 4263-4266 - [c19]Junqing Li, Shengxian Xie, Quan-Ke Pan, Kaizhou Gao, Baoxian Jia, Yuting Wang:
A Novel Time Decaying Model for P2P Networks. MVHI 2010: 203-205 - [c18]Junqing Li, Shengxian Xie, Quan-Ke Pan, Kaizhou Gao, Baoxian Jia, Yuting Wang:
An Effective Trust-Based Search Approach in Peer-to-Peer Network. MVHI 2010: 206-209 - [c17]Junqing Li, Quan-Ke Pan, Shengxian Xie, Jing Liang:
A Hybrid Pareto-Based Tabu Search for Multi-objective Flexible Job Shop Scheduling Problem with E/T Penalty. ICSI (1) 2010: 620-627
2000 – 2009
- 2009
- [j4]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Yun-Chia Liang:
A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times. Comput. Oper. Res. 36(6): 1900-1915 (2009) - [j3]Quan-Ke Pan, Ling Wang, Bin Qian:
A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems. Comput. Oper. Res. 36(8): 2498-2511 (2009) - [c16]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai N. Suganthan, Yun-Chia Liang:
A differential evolution algorithm with variable parameter search for real-parameter continuous function optimization. IEEE Congress on Evolutionary Computation 2009: 1247-1254 - [c15]Quan-Ke Pan, Ponnuthurai N. Suganthan, Mehmet Fatih Tasgetiren:
A Harmony Search Algorithm with Ensemble of Parameter Sets. IEEE Congress on Evolutionary Computation 2009: 1815-1820 - [c14]Liping Zheng, Guangyao Li, Jing Liang, Quan-Ke Pan:
Improved 2D Maximum Entropy Threshold Segmentation Method based on PSO. IJCCI 2009: 287-292 - [c13]Fengrui Wang, Wenhong Wang, Quan-Ke Pan, Fengchao Zuo:
A Novel Online Test-Sheet Composition Approach Using Genetic Algorithm. ISICA 2009: 1-10 - [c12]Kaizhou Gao, Quan-Ke Pan, Qiang Qiang Sun:
Conceptual Design Knowledge Retrieval, Reuse and Innovation Based on Case and Constraint. WKDD 2009: 163-166 - 2008
- [j2]Quan-Ke Pan, Mehmet Fatih Tasgetiren, Yun-Chia Liang:
A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Comput. Ind. Eng. 55(4): 795-816 (2008) - [j1]Quan-Ke Pan, Mehmet Fatih Tasgetiren, Yun-Chia Liang:
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput. Oper. Res. 35(9): 2807-2839 (2008) - [c11]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Yun-Chia Liang:
A discrete differential evolution algorithm for single machine total weighted tardiness problem with sequence dependent setup times. IEEE Congress on Evolutionary Computation 2008: 2613-2620 - [c10]Quan-Ke Pan, Mehmet Fatih Tasgetiren, Yun-Chia Liang, Ponnuthurai N. Suganthan:
Upper bounds on Taillard's benchmark suite for the no-wait flowshop scheduling problem with makespan criterion. IEEE Congress on Evolutionary Computation 2008: 2955-2961 - [c9]Junqing Li, Quan-Ke Pan, Shengxian Xie:
Research on Peer Selection in Peer-to-Peer Networks using Ant Colony Optimization. ICNC (7) 2008: 516-520 - 2007
- [c8]Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan, Quan-Ke Pan, Yun-Chia Liang:
A genetic algorithm for the generalized traveling salesman problem. IEEE Congress on Evolutionary Computation 2007: 2382-2389 - [c7]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai Nagaratnam Suganthan, Yun-Chia Liang:
A Discrete Differential Evolution Algorithm for the No-Wait Flowshop Scheduling Problem with Total Flowtime Criterion. CISched 2007: 251-258 - [c6]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Yun-Chia Liang, Ponnuthurai Nagaratnam Suganthan:
A Discrete Differential Evolution Algorithm for the Total Earliness and Tardiness Penalties with a Common Due Date on a Single-Machine. CISched 2007: 271-278 - [c5]Quan-Ke Pan, Mehmet Fatih Tasgetiren, Yun-Chia Liang:
A discrete differential evolution algorithm for the permutation flowshop scheduling problem. GECCO 2007: 126-133 - [c4]Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan, Quan-Ke Pan:
A discrete particle swarm optimization algorithm for the generalized traveling salesman problem. GECCO 2007: 158-167 - 2006
- [c3]Quan-Ke Pan, Mehmet Fatih Tasgetiren, Yun-Chia Liang:
Minimizing Total Earliness and Tardiness Penalties with a Common Due Date on a Single-Machine Using a Discrete Particle Swarm Optimization Algorithm. ANTS Workshop 2006: 460-467 - [c2]Quan-Ke Pan, Mehmet Fatih Tasgetiren, Yun-Chia Liang:
A Discrete Particle Swarm Optimization Algorithm for Single Machine Total Earliness and Tardiness Problem with a Common Due Date. IEEE Congress on Evolutionary Computation 2006: 3281-3288 - [c1]Quan-Ke Pan, Mehmet Fatih Tasgetiren, Yun-Chia Liang:
A Discrete Particle Swarm Optimization Algorithm for the Permutation Flowshop Sequencing Problem with Makespan Criterion. SGAI Conf. 2006: 19-31
Coauthor Index
Kai-Zhou Gao
aka: Kaizhou Gao
aka: Kaizhou Gao
[j157] [j151] [j146] [j143] [j142] [j141] [j139] [j138] [j136] [j133] [j130] [j124] [j121] [j120] [j119] [j116] [j115] [j113] [j110] [j109] [j108] [j107] [j106] [j105] [j102] [j99] [j96] [j94] [j93] [j91] [j90] [j89] [j88] [j87] [j86] [j85] [j83] [j78] [j76] [j72] [c61] [j70] [j69] [j68] [j64] [j62] [j61] [j57] [c52] [j51] [j50] [c45] [c44] [j42] [j33] [j21] [j18] [j15] [j13]
Zhonghua Miao
aka: Zhong-Hua Miao
aka: Zhong-Hua Miao
Hongyan Sang
aka: Hong-yan Sang
aka: Hong-yan Sang
Ponnuthurai N. Suganthan
aka: Ponnuthurai Nagaratnam Suganthan
aka: Ponnuthurai Nagaratnam Suganthan
[j129] [j114] [j111] [j105] [j99] [j98] [j95] [c63] [c62] [j89] [j84] [c60] [c59] [c58] [c57] [j60] [c54] [c53] [j56] [j55] [j48] [c50] [c49] [c48] [c47] [c46] [j44] [c43] [c42] [c41] [j30] [c40] [c39] [c38] [c36] [c35] [j22] [j20] [j17] [j16] [j12] [j11] [c33] [c32] [j10] [j9] [j5] [c26] [c25] [c24] [j4] [c16] [c15] [j2] [j1] [c11] [c10] [c8] [c7] [c6] [c5] [c4] [c3] [c2] [c1]
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 23:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
