Artikkelit, joihin on yleisen käytön mandaatti - Weishi ShaoLisätietoja
Ei saatavilla missään: 25
A Pareto-based estimation of distribution algorithm for solving multiobjective distributed no-wait flow-shop scheduling problem with sequence-dependent setup time
W Shao, D Pi, Z Shao
IEEE Transactions on Automation Science and Engineering 16 (3), 1344-1360, 2019
Mandaatit: National Natural Science Foundation of China
Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms
W Shao, D Pi, Z Shao
Knowledge-Based Systems 137, 163-181, 2017
Mandaatit: National Natural Science Foundation of China
Multi-objective evolutionary algorithm based on multiple neighborhoods local search for multi-objective distributed hybrid flow shop scheduling problem
W Shao, Z Shao, D Pi
Expert systems with applications 183, 115453, 2021
Mandaatit: National Natural Science Foundation of China
A novel discrete water wave optimization algorithm for blocking flow-shop scheduling problem with sequence-dependent setup times
Z Shao, D Pi, W Shao
Swarm and Evolutionary Computation 40, 53-75, 2018
Mandaatit: National Natural Science Foundation of China
Local search methods for a distributed assembly no-idle flow shop scheduling problem
W Shao, D Pi, Z Shao
IEEE Systems Journal 13 (2), 1945-1956, 2018
Mandaatit: National Natural Science Foundation of China
An extended teaching-learning based optimization algorithm for solving no-wait flow shop scheduling problem
W Shao, D Pi, Z Shao
Applied Soft Computing 61, 193-210, 2017
Mandaatit: National Natural Science Foundation of China
Modelling and optimization of distributed heterogeneous hybrid flow shop lot-streaming scheduling problem
W Shao, Z Shao, D Pi
Expert Systems with Applications 214, 119151, 2023
Mandaatit: National Natural Science Foundation of China
Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem
W Shao, Z Shao, D Pi
Computers & Operations Research 136, 105482, 2021
Mandaatit: National Natural Science Foundation of China
Memetic algorithm with node and edge histogram for no-idle flow shop scheduling problem to minimize the makespan criterion
W Shao, D Pi, Z Shao
Applied Soft Computing 54, 164-182, 2017
Mandaatit: National Natural Science Foundation of China
A hybrid discrete optimization algorithm based on teaching–probabilistic learning mechanism for no-wait flow shop scheduling
W Shao, D Pi, Z Shao
Knowledge-Based Systems 107, 219-234, 2016
Mandaatit: National Natural Science Foundation of China
A novel multi-objective discrete water wave optimization for solving multi-objective blocking flow-shop scheduling problem
Z Shao, D Pi, W Shao
Knowledge-Based Systems 165, 110-131, 2019
Mandaatit: National Natural Science Foundation of China
An efficient discrete invasive weed optimization for blocking flow-shop scheduling problem
Z Shao, D Pi, W Shao, P Yuan
Engineering Applications of Artificial Intelligence 78, 124-141, 2019
Mandaatit: National Natural Science Foundation of China
A self-guided differential evolution with neighborhood search for permutation flow shop scheduling
W Shao, D Pi
Expert Systems with Applications 51, 161-176, 2016
Mandaatit: National Natural Science Foundation of China
LS-HH: A learning-based selection hyper-heuristic for distributed heterogeneous hybrid blocking flow-shop scheduling
Z Shao, W Shao, D Pi
IEEE Transactions on Emerging Topics in Computational Intelligence 7 (1 …, 2022
Mandaatit: National Natural Science Foundation of China
A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion
W Shao, D Pi, Z Shao
Computers & Operations Research 94, 89-105, 2018
Mandaatit: National Natural Science Foundation of China
A network memetic algorithm for energy and labor-aware distributed heterogeneous hybrid flow shop scheduling problem
W Shao, Z Shao, D Pi
Swarm and Evolutionary Computation 75, 101190, 2022
Mandaatit: National Natural Science Foundation of China
Effective constructive heuristic and iterated greedy algorithm for distributed mixed blocking permutation flow-shop scheduling problem
Z Shao, W Shao, D Pi
Knowledge-Based Systems 221, 106959, 2021
Mandaatit: National Natural Science Foundation of China
Self-adaptive discrete invasive weed optimization for the blocking flow-shop scheduling problem to minimize total tardiness
Z Shao, D Pi, W Shao
Computers & Industrial Engineering 111, 331-351, 2017
Mandaatit: National Natural Science Foundation of China
Estimation of distribution algorithm with path relinking for the blocking flow-shop scheduling problem
Z Shao, D Pi, W Shao
Engineering Optimization 50 (5), 894-916, 2018
Mandaatit: National Natural Science Foundation of China
A multi-objective discrete invasive weed optimization for multi-objective blocking flow-shop scheduling problem
Z Shao, D Pi, W Shao
Expert Systems with Applications 113, 77-99, 2018
Mandaatit: National Natural Science Foundation of China
Tietokoneohjelma arvioi ja määrittää julkaisu- ja rahoitustiedot automaattisesti