Hanyu Gu

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem
Annals of Operations Research
2024-08-15Paper
Minimizing patients total clinical condition deterioration in operating theatre departments
Annals of Operations Research
2023-09-05Paper
A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty
EURO Journal on Computational Optimization
2023-07-12Paper
An efficient optimisation procedure for the workforce scheduling and routing problem: Lagrangian relaxation and iterated local search
Computers & Operations Research
2022-06-22Paper
Planning rolling stock maintenance: optimization of train arrival dates at a maintenance center
Journal of Industrial and Management Optimization
2022-02-16Paper
Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements
Journal of Discrete Algorithms
2019-01-18Paper
Planning personnel retraining: column generation heuristics
Journal of Combinatorial Optimization
2018-12-06Paper
Scheduling batch processing in flexible flowshop with job dependent buffer requirements: Lagrangian relaxation approach2018-06-15Paper
Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements
Lecture Notes in Computer Science
2018-06-15Paper
Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem
Theoretical Computer Science
2018-03-16Paper
A multi-stage IP-based heuristic for class timetabling and trainer rostering
Annals of Operations Research
2017-08-16Paper
Scheduling personnel retraining: column generation heuristics
Lecture Notes in Computer Science
2016-11-30Paper
Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom
Computers & Operations Research
2016-11-17Paper
Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities
Computers & Operations Research
2016-11-17Paper
A Lagrangian relaxation-based heuristic to solve large extended graph partitioning problems
WALCOM: Algorithms and Computation
2016-05-03Paper
A Lagrangian relaxation based forward-backward improvement heuristic for maximising the net present value of resource-constrained projects
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
2013-06-04Paper
Study on constraint scheduling algorithm for job shop problems with multiple constraint machines
International Journal of Production Research
2008-10-01Paper
Robust scheduling in a just-in-time single machine system with processing time uncertainty2008-08-06Paper
A heuristic method for jobshop scheduling based on decomposed due date2008-06-18Paper
Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem
Computers & Operations Research
2008-04-16Paper
A rolling window optimization method for large-scale WCDMA base stations planning problem
European Journal of Operational Research
2007-06-25Paper
A Benders decomposition algorithm for base station planning problem in WCDMA networks
Computers & Operations Research
2007-01-09Paper
scientific article; zbMATH DE number 5063559 (Why is no real title available?)2006-10-13Paper
Planning algorithm for WCDMA base station location problem based on cluster decomposition2006-05-23Paper
scientific article; zbMATH DE number 2219456 (Why is no real title available?)2005-10-27Paper
Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem
Computers & Operations Research
2005-06-27Paper
Sensitivity analysis based objective coordination of constrained multi-objective multi-degree-of-freedom optimization
Science in China. Series E
1999-04-29Paper


Research outcomes over time


This page was built for person: Hanyu Gu