Solving Project Scheduling Problems by Minimum Cut Computations
Management Science
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Why cumulative decomposition is not as bad as it sounds
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
An approximative criterion for the potential of energetic reasoning
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Explanations for the cumulative constraint: an experimental study
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Solving two-machine assembly scheduling problems with inventory constraints
Computers and Industrial Engineering
Reconsidering mixed integer programming and MIP-Based hybrids for scheduling
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Hi-index | 0.00 |
We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of practical relevance. Jobs have to be scheduled on (renewable) resources subject to precedence constraints such that the resource capacities are never exceeded and the latest completion time of all jobs is minimized. The problem has challenged researchers from different communities, such as integer programming (IP), constraint programming (CP), and satisfiability testing (SAT). Still, there are instances with 60 jobs which have not been solved for many years. The currently best known approach, lazyFD, is a hybrid between CP and SAT techniques. In this paper we propose an even stronger hybridization by integrating all the three areas, IP, CP, and SAT, into a single branch-and-bound scheme. We show that lower bounds from the linear relaxation of the IP formulation and conflict analysis are key ingredients for pruning the search tree. First computational experiments show very promising results. For five instances of the well-known PSPLib we report an improvement of lower bounds. Our implementation is generic, thus it can be potentially applied to similar problems as well.