Progressive solutions: a simple but efficient dominance rule for practical RCPSP

  • Authors:

  • András Kovács;József Váncza

  • Affiliations:

  • Computer and Automation Research Institute, Hungarian Academy of Sciences;Computer and Automation Research Institute, Hungarian Academy of Sciences

  • Venue:
  • CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper addresses the solution of practical resource-constrained project scheduling problems (RCPSP). We point out that such problems often contain many, in a sense similar projects, and this characteristic can be exploited well to improve the performance of current constraint-based solvers on these problems. For that purpose, we define the straightforward but generic notion of progressive solution, in which the order of corresponding tasks of similar projects is deduced a priori. We prove that the search space can be reduced to progressive solutions. Computational experiments on two different sets of industrial problem instances are also presented.