Yuting Wang
Orcid: 0000-0002-1562-2764Affiliations:
- Liaocheng University, College of Computer Science, China
According to our database1,
Yuting Wang
authored at least 22 papers
between 2010 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
An accelerated discrete artificial bee colony algorithm under the makespan constraint: Solving the distributed blocking flow shop scheduling problem with balanced energy consumption costs.
Expert Syst. Appl., 2025
2024
Joint scheduling of AGVs and parallel machines in an automated electrode foil production factory.
Expert Syst. Appl., March, 2024
Theoretical analysis and methods of rapid evaluation: Solving the blocking flowshop group scheduling problem with the total flow time and total tardiness time criteria.
Swarm Evol. Comput., 2024
A novel collaborative iterative greedy algorithm for hybrid flowshop scheduling problem with batch processing machines and variable sublots.
Int. J. Prod. Res., 2024
Theoretical analysis and implementation of mandatory operations-based accelerated search in graph space for hybrid flow shop scheduling.
Expert Syst. Appl., 2024
Accelerated evaluation of blocking flowshop scheduling with total flow time criteria using a generalized critical machine-based approach.
Eur. J. Oper. Res., 2024
A Penalty Groups-Assisted Iterated Greedy Integrating Idle Time Insertion: Solving the Hybrid Flow Shop Group Scheduling with Delivery Time Windows.
Complex Syst. Model. Simul., 2024
2023
Redefining hybrid flow shop group scheduling: Unveiling a novel hybrid modeling paradigm and assessing 48 MILP and CP models.
Swarm Evol. Comput., December, 2023
An effective two-stage iterated greedy algorithm for distributed flowshop group scheduling problem with setup time.
Expert Syst. Appl., December, 2023
Intelligent optimization under the makespan constraint: Rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem.
Eur. J. Oper. Res., December, 2023
Joint scheduling of parallel machines and AGVs with sequence-dependent setup times in a matrix workshop.
Comput. Ind. Eng., November, 2023
Energy-Efficient Iterative Greedy Algorithm for the Distributed Hybrid Flow Shop Scheduling With Blocking Constraints.
IEEE Trans. Emerg. Top. Comput. Intell., October, 2023
Intelligent Optimization Under Multiple Factories: Hybrid Flow Shop Scheduling Problem with Blocking Constraints Using an Advanced Iterated Greedy Algorithm.
Complex Syst. Model. Simul., 2023
2022
Intelligent optimization under blocking constraints: A novel iterated greedy algorithm for the hybrid flow shop group scheduling problem.
Knowl. Based Syst., 2022
2012
Asia Pac. J. Oper. Res., 2012
2011
Memetic Algorithm based on Improved Inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem.
Comput. Math. Appl., 2011
Hybrid algorithm based on Chemical Reaction Optimization and Lin-Kernighan local search for the Traveling Salesman Problem.
Proceedings of the Seventh International Conference on Natural Computation, 2011
Proceedings of the Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, 2011
Proceedings of the Advanced Intelligent Computing - 7th International Conference, 2011
2010
Proceedings of the 2010 International Conference on Machine Vision and Human-machine Interface, 2010
Proceedings of the 2010 International Conference on Machine Vision and Human-machine Interface, 2010
Proceedings of the Sixth International Conference on Natural Computation, 2010