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