default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWeishi Shao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Zhongshi Shao, Weishi Shao, Jianrui Chen, Dechang Pi:
A feedback learning-based selection hyper-heuristic for distributed heterogeneous hybrid blocking flow-shop scheduling problem with flexible assembly and setup time. Eng. Appl. Artif. Intell. 131: 107818 (2024)- [j29]Zeyu Zhang, Zhongshi Shao
, Weishi Shao, Jianrui Chen, Dechang Pi:
MRLM: A meta-reinforcement learning-based metaheuristic for hybrid flow-shop scheduling problem with learning and forgetting effects. Swarm Evol. Comput. 85: 101479 (2024) - [j28]Qichen Zhang, Weishi Shao, Zhongshi Shao, Dechang Pi, Jiaquan Gao:
Deep reinforcement learning driven trajectory-based meta-heuristic for distributed heterogeneous flexible job shop scheduling problem. Swarm Evol. Comput. 91: 101753 (2024) - [j27]Weishi Shao, Zhongshi Shao, Dechang Pi:
Lot Sizing and Scheduling Problem in Distributed Heterogeneous Hybrid Flow Shop and Learning-Driven Iterated Local Search Algorithm. IEEE Trans Autom. Sci. Eng. 21(4): 6483-6497 (2024) - 2023
- [j26]Weishi Shao, Zhongshi Shao, Dechang Pi:
Modelling and optimization of distributed heterogeneous hybrid flow shop lot-streaming scheduling problem. Expert Syst. Appl. 214: 119151 (2023) - [j25]Zhongshi Shao, Weishi Shao, Dechang Pi:
LS-HH: A Learning-Based Selection Hyper-Heuristic for Distributed Heterogeneous Hybrid Blocking Flow-Shop Scheduling. IEEE Trans. Emerg. Top. Comput. Intell. 7(1): 111-127 (2023) - 2022
- [j24]Weishi Shao, Zhongshi Shao, Dechang Pi:
Multi-local search-based general variable neighborhood search for distributed flow shop scheduling in heterogeneous multi-factories. Appl. Soft Comput. 125: 109138 (2022) - [j23]Weishi Shao, Zhongshi Shao, Dechang Pi:
A multi-neighborhood-based multi-objective memetic algorithm for the energy-efficient distributed flexible flow shop scheduling problem. Neural Comput. Appl. 34(24): 22303-22330 (2022) - [j22]Weishi Shao, Zhongshi Shao, Dechang Pi:
A network memetic algorithm for energy and labor-aware distributed heterogeneous hybrid flow shop scheduling problem. Swarm Evol. Comput. 75: 101190 (2022) - [j21]Weishi Shao, Zhongshi Shao, Dechang Pi:
An Ant Colony Optimization Behavior-Based MOEA/D for Distributed Heterogeneous Hybrid Flow Shop Scheduling Problem Under Nonidentical Time-of-Use Electricity Tariffs. IEEE Trans Autom. Sci. Eng. 19(4): 3379-3394 (2022) - 2021
- [j20]Weishi Shao, Zhongshi Shao, Dechang Pi:
Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem. Comput. Oper. Res. 136: 105482 (2021) - [j19]Weishi Shao, Zhongshi Shao, Dechang Pi:
Multi-objective evolutionary algorithm based on multiple neighborhoods local search for multi-objective distributed hybrid flow shop scheduling problem. Expert Syst. Appl. 183: 115453 (2021) - [j18]Zhongshi Shao, Weishi Shao, Dechang Pi:
Effective constructive heuristic and iterated greedy algorithm for distributed mixed blocking permutation flow-shop scheduling problem. Knowl. Based Syst. 221: 106959 (2021) - 2020
- [j17]Zhongshi Shao, Weishi Shao, Dechang Pi:
Effective Constructive Heuristic and Metaheuristic for the Distributed Assembly Blocking Flow-shop Scheduling Problem. Appl. Intell. 50(12): 4647-4669 (2020) - [j16]Zhongshi Shao, Dechang Pi, Weishi Shao:
Hybrid enhanced discrete fruit fly optimization algorithm for scheduling blocking flow-shop in distributed environment. Expert Syst. Appl. 145: 113147 (2020) - [j15]Weishi Shao, Zhongshi Shao, Dechang Pi:
Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem. Knowl. Based Syst. 194: 105527 (2020) - [j14]Zhongshi Shao, Weishi Shao, Dechang Pi:
Effective heuristics and metaheuristics for the distributed fuzzy blocking flow-shop scheduling problem. Swarm Evol. Comput. 59: 100747 (2020)
2010 – 2019
- 2019
- [j13]Zhongshi Shao, Dechang Pi, Weishi Shao, Peisen Yuan:
An efficient discrete invasive weed optimization for blocking flow-shop scheduling problem. Eng. Appl. Artif. Intell. 78: 124-141 (2019) - [j12]Zhongshi Shao, Dechang Pi, Weishi Shao:
A novel multi-objective discrete water wave optimization for solving multi-objective blocking flow-shop scheduling problem. Knowl. Based Syst. 165: 110-131 (2019) - [j11]Weishi Shao, Dechang Pi, Zhongshi Shao:
Local Search Methods for a Distributed Assembly No-Idle Flow Shop Scheduling Problem. IEEE Syst. J. 13(2): 1945-1956 (2019) - [j10]Weishi Shao, Dechang Pi, Zhongshi Shao:
A Pareto-Based Estimation of Distribution Algorithm for Solving Multiobjective Distributed No-Wait Flow-Shop Scheduling Problem With Sequence-Dependent Setup Time. IEEE Trans Autom. Sci. Eng. 16(3): 1344-1360 (2019) - 2018
- [j9]Weishi Shao, Dechang Pi, Zhongshi Shao:
A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion. Comput. Oper. Res. 94: 89-105 (2018) - [j8]Zhongshi Shao, Dechang Pi, Weishi Shao:
A multi-objective discrete invasive weed optimization for multi-objective blocking flow-shop scheduling problem. Expert Syst. Appl. 113: 77-99 (2018) - [j7]Zhongshi Shao, Dechang Pi, Weishi Shao:
A novel discrete water wave optimization algorithm for blocking flow-shop scheduling problem with sequence-dependent setup times. Swarm Evol. Comput. 40: 53-75 (2018) - 2017
- [j6]Weishi Shao, Dechang Pi, Zhongshi Shao:
Memetic algorithm with node and edge histogram for no-idle flow shop scheduling problem to minimize the makespan criterion. Appl. Soft Comput. 54: 164-182 (2017) - [j5]Weishi Shao, Dechang Pi, Zhongshi Shao:
An extended teaching-learning based optimization algorithm for solving no-wait flow shop scheduling problem. Appl. Soft Comput. 61: 193-210 (2017) - [j4]Zhongshi Shao, Dechang Pi, Weishi Shao:
Self-adaptive discrete invasive weed optimization for the blocking flow-shop scheduling problem to minimize total tardiness. Comput. Ind. Eng. 111: 331-351 (2017) - [j3]Weishi Shao, Dechang Pi, Zhongshi Shao:
Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms. Knowl. Based Syst. 137: 163-181 (2017) - [c1]Weishi Shao, Dechang Pi, Zhongshi Shao:
A hybrid iterated greedy algorithm for the distributed no-wait flow shop scheduling problem. CEC 2017: 9-16 - 2016
- [j2]Weishi Shao, Dechang Pi:
A self-guided differential evolution with neighborhood search for permutation flow shop scheduling. Expert Syst. Appl. 51: 161-176 (2016) - [j1]Weishi Shao, Dechang Pi, Zhongshi Shao:
A hybrid discrete optimization algorithm based on teaching-probabilistic learning mechanism for no-wait flow shop scheduling. Knowl. Based Syst. 107: 219-234 (2016)
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-11-07 21:28 CET 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:
