default search action
Kunkun Peng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [e2]Weiming Shen, Jean-Paul A. Barthès, Junzhou Luo, Tie Qiu, Xiaobo Zhou, Jinghui Zhang, Haibin Zhu, Kunkun Peng, Tianyi Xu, Ning Chen:
27th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2024, Tianjin, China, May 8-10, 2024. IEEE 2024, ISBN 979-8-3503-4918-4 [contents] - 2023
- [j9]Yanan Song, Weiming Shen, Kunkun Peng:
A novel partial point cloud registration method based on graph attention network. Vis. Comput. 39(3): 1109-1120 (2023) - [e1]Weiming Shen, Jean-Paul A. Barthès, Junzhou Luo, Adriana S. Vivacqua, Daniel Schneider, Cheng Xie, Jinghui Zhang, Haibin Zhu, Kunkun Peng, Cláudia Lage Rebello da Motta:
26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023, Rio de Janeiro, Brazil, May 24-26, 2023. IEEE 2023, ISBN 979-8-3503-3168-4 [contents] - 2022
- [j8]Yanan Song, Liang Gao, Xinyu Li, Weiming Shen, Kunkun Peng:
A novel vision-based multi-task robotic grasp detection method for multi-object scenes. Sci. China Inf. Sci. 65(12) (2022) - [c3]Linlin Zhao, Weiming Shen, Chunjiang Zhang, Kunkun Peng:
An End-to-End Deep Reinforcement Learning Approach for Job Shop Scheduling. CSCWD 2022: 841-846 - 2021
- [j7]Chunjiang Zhang, Jiawei Tan, Kunkun Peng, Liang Gao, Weiming Shen, Kunlei Lian:
A discrete whale swarm algorithm for hybrid flow-shop scheduling problem with limited buffers. Robotics Comput. Integr. Manuf. 68: 102081 (2021) - 2020
- [j6]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)
2010 – 2019
- 2019
- [j5]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) - [j4]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) - [j3]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) - [c2]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
- [j2]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) - 2015
- [c1]Kunkun Peng, Yindong Shen, Jingpeng Li:
A Multi-objective Simulated Annealing for Bus Driver Rostering. BIC-TA 2015: 315-330 - 2011
- [j1]Xinping Xiao, Kunkun Peng:
Research on generalized non-equidistance GM(1, 1) model based on matrix analysis. Grey Syst. Theory Appl. 1(1): 87-96 (2011)
Coauthor Index
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-10-07 22:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint