Junwen Ding

Orcid: 0000-0002-0618-4969

According to our database1, Junwen Ding authored at least 21 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Weighted Vertex Cover-Based Intensification Tabu Search for the Capacitated Dispersion Problem.
IEEE Trans. Emerg. Top. Comput. Intell., December, 2024

The flexible job shop scheduling problem: A review.
Eur. J. Oper. Res., April, 2024

Guiding Solution Based Local Search for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Problem.
IEEE Trans. Emerg. Top. Comput. Intell., February, 2024

A Swap Relaxation-Based Local Search for the Latin Square Completion Problem.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

2023
An Effective Scoring-Based Metaheuristic Algorithm for Rectilinear Block Placement.
IEEE Trans. Emerg. Top. Comput. Intell., December, 2023

A Novel Evolutionary Algorithm for Energy-Efficient Scheduling in Flexible Job Shops.
IEEE Trans. Evol. Comput., October, 2023

Multi-start local search algorithm based on a novel objective function for clustering analysis.
Appl. Intell., September, 2023

A Memetic Algorithm for the Multi-Depot Vehicle Routing Problem.
Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2023

A Heuristic Method for Data Allocation and Task Scheduling on Heterogeneous Multiprocessor Systems Under Memory Constraints.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2023

2022
PACE Solver Description: Hust-Solver - A Heuristic Algorithm of Directed Feedback Vertex Set Problem.
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

2021
Energy aware scheduling in flexible flow shops with hybrid particle swarm optimization.
Comput. Oper. Res., 2021

2020
A Hybrid Memetic Algorithm for the Parallel Machine Scheduling Problem With Job Deteriorating Effects.
IEEE Trans. Emerg. Top. Comput. Intell., 2020

Adaptive memory programming for the dynamic bipartite drawing problem.
Inf. Sci., 2020

2019
Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration.
Comput. Oper. Res., 2019

A Two-Individual Based Evolutionary Algorithm for the Flexible Job Shop Scheduling Problem.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2017
Greedy Randomized Adaptive Search Procedure with Path-Relinking for the Vertex p-Center Problem.
J. Comput. Sci. Technol., 2017

A quality and distance guided hybrid algorithm for the vertex separator problem.
Comput. Oper. Res., 2017

A hybrid evolutionary approach for the single-machine total weighted tardiness problem.
Comput. Ind. Eng., 2017

A Quality and Distance Guided Metaheuristic Algorithm for Vertex Separation Problem.
IEEE Access, 2017

2016
Multi-start iterated tabu search for the minimum weight vertex cover problem.
J. Comb. Optim., 2016

Breakout dynasearch for the single-machine total weighted tardiness problem.
Comput. Ind. Eng., 2016


  Loading...