default search action
Shengchao Zhou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c2]Shengchao Zhou, Gaofeng Meng, Zhaoxiang Zhang, Richard Yi Da Xu
, Shiming Xiang:
Robust Feature Rectification of Pretrained Vision Models for Object Recognition. AAAI 2023: 3796-3804 - [c1]Shengchao Zhou, Weizhou Liu, Chen Hu, Shuchang Zhou, Chao Ma:
UniDistill: A Universal Cross-Modality Knowledge Distillation Framework for 3D Object Detection in Bird's-Eye View. CVPR 2023: 5116-5125 - [i1]Shengchao Zhou, Weizhou Liu, Chen Hu, Shuchang Zhou, Chao Ma:
UniDistill: A Universal Cross-Modality Knowledge Distillation Framework for 3D Object Detection in Bird's-Eye View. CoRR abs/2303.15083 (2023) - 2022
- [j10]Shengchao Zhou, Zhaohong Jia, Mingzhou Jin
Minimizing makespan on parallel batch processing machines with two-dimensional rectangular jobs. Comput. Ind. Eng. 169: 108167 (2022) - [j9]Shengchao Zhou, Mingzhou Jin
Scheduling a single batch processing machine with non-identical two-dimensional job sizes. Expert Syst. Appl. 201: 116907 (2022) - 2021
- [j8]Shengchao Zhou
A Self-Adaptive Differential Evolution Algorithm for Scheduling a Single Batch-Processing Machine With Arbitrary Job Sizes and Release Times. IEEE Trans. Cybern. 51(3): 1430-1442 (2021) - 2020
- [j7]Xu Zheng
Energy-efficient scheduling for multi-objective two-stage flow shop using a hybrid ant colony optimisation algorithm. Int. J. Prod. Res. 58(13): 4103-4120 (2020) - [j6]Zhen Chen, Xu Zheng
Quantum-inspired ant colony optimisation algorithm for a two-stage permutation flow shop with batch processing machines. Int. J. Prod. Res. 58(19): 5945-5963 (2020)
2010 – 2019
- 2019
- [j5]Xinle Liang, Shengchao Zhou, Huaping Chen, Rui Xu:
Pseudo transformation mechanism between resource allocation and bin-packing in batching environments. Future Gener. Comput. Syst. 95: 79-88 (2019) - [j4]Xu Zheng
Ant colony optimisation algorithms for two-stage permutation flow shop with batch processing machines and nonidentical job sizes. Int. J. Prod. Res. 57(10): 3060-3079 (2019) - 2018
- [j3]Shengchao Zhou, Jianhui Xie, Ni Du, Yan Pang:
A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes. Appl. Math. Comput. 334: 254-268 (2018) - [j2]Shengchao Zhou, Xiaolin Li, Ni Du, Yan Pang, Huaping Chen
A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost. Comput. Oper. Res. 96: 55-68 (2018) - 2017
- [j1]Shengchao Zhou, Huaping Chen
Distance matrix based heuristics to minimize makespan of parallel batch processing machines with arbitrary job sizes and release times. Appl. Soft Comput. 52: 630-641 (2017)
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-04-24 22:49 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: