Hanyu Gu
Orcid: 0000-0003-2035-2583Affiliations:
- University of Technology Sydney, Australia
- Shanghai Jiao Tong University, China
According to our database1,
Hanyu Gu
authored at least 32 papers
between 2005 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
An Efficient Approximate Dynamic Programming Approach for Resource-Constrained Project Scheduling with Uncertain Task Duration.
Proceedings of the 13th International Conference on Operations Research and Enterprise Systems, 2024
2023
Minimizing patients total clinical condition deterioration in operating theatre departments.
Ann. Oper. Res., September, 2023
A Forward-Backward Relax-and-Solve Algorithm for the Resource-Constrained Project Scheduling Problem.
SN Comput. Sci., March, 2023
Heuristics and meta-heuristic to solve the ROADEF/EURO challenge 2020 maintenance planning problem.
J. Heuristics, February, 2023
2022
ABFIA: A hybrid algorithm based on artificial bee colony and Fibonacci indicator algorithm.
J. Comput. Sci., 2022
A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty.
EURO J. Comput. Optim., 2022
An efficient optimisation procedure for the Workforce Scheduling and Routing Problem: Lagrangian relaxation and iterated local search.
Comput. Oper. Res., 2022
An Efficient Relax-and-Solve Algorithm for the Resource-Constrained Project Scheduling Problem.
Proceedings of the 11th International Conference on Operations Research and Enterprise Systems, 2022
2021
Iterated Local Search with Neighbourhood Reduction for the Pickups and Deliveries Problem Arising in Retail Industry.
Proceedings of the Optimization and Learning - 4th International Conference, 2021
Proceedings of the Optimization and Learning - 4th International Conference, 2021
2020
Proceedings of the 2020 IEEE Symposium Series on Computational Intelligence, 2020
Optimal Lagrangian Multipliers for the Multidimensional Knapsack Problem: a Bayesian Optimisation Approach.
Proceedings of the 2020 IEEE Symposium Series on Computational Intelligence, 2020
2019
Lagrangian Relaxation in Iterated Local Search for the Workforce Scheduling and Routing Problem.
Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019
Proceedings of the Advanced Computational Methods for Knowledge Engineering, 2019
2018
Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem.
Theor. Comput. Sci., 2018
Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements.
J. Discrete Algorithms, 2018
Scheduling Batch Processing in Flexible Flowshop with Job Dependent Buffer Requirements: Lagrangian Relaxation Approach.
Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018
2017
Ann. Oper. Res., 2017
Efficient Lagrangian Heuristics for the Two-Stage Flow Shop with Job Dependent Buffer Requirements.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017
2016
Improving problem reduction for 0-1 Multidimensional Knapsack Problems with valid inequalities.
Comput. Oper. Res., 2016
Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom.
Comput. Oper. Res., 2016
A Lagrangian Relaxation-Based Heuristic to Solve Large Extended Graph Partitioning Problems.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016
2014
A Lagrangian relaxation and ACO hybrid for resource constrained project scheduling with discounted cash flows.
J. Heuristics, 2014
2013
A Lagrangian Relaxation Based Forward-Backward Improvement Heuristic for Maximising the Net Present Value of Resource-Constrained Projects.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013
2012
Proceedings of the Principles and Practice of Constraint Programming, 2012
2008
Computation of approximate alpha-points for large scale single machine scheduling problem.
Comput. Oper. Res., 2008
2007
A rolling window optimization method for large-scale WCDMA base stations planning problem.
Eur. J. Oper. Res., 2007
A Benders decomposition algorithm for base station planning problem in WCDMA networks.
Comput. Oper. Res., 2007
Randomized Lagrangian heuristic based on Nash equilibrium for large scale single machine scheduling problem.
Proceedings of the 22nd IEEE International Symposium on Intelligent Control, 2007
2005
Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem.
Comput. Oper. Res., 2005