Progressive Solutions: A Simple but Efficient Dominance Rule for Practical RCPSP
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.
KeywordsSchedule Problem Problem Instance Product Family Precedence Constraint Constraint Satisfaction Problem
Unable to display preview. Download preview PDF.
- 6.Kovács, A.: Novel Models and Algorithms for Integrated Production Planning and Scheduling. PhD Thesis, Budapest University of Technology and Economics (2005), http://www.sztaki.hu/~akovacs/thesis/
- 10.Nuijten, W., Bousonville, T., Focacci, F., Godard, D., Le Pape, C.: Towards an Industrial Manufacturing Scheduling Problem and Test Bed. In: Proc. of the 9th Int. Conf. on Project Management and Scheduling, pp. 162–165 (2004)Google Scholar
- 11.Petrie, K.E., Smith, B.M.: Comparison of Symmetry Breaking Methods in Constraint Programming. In: Proc. of the 5th International Workshop on Symmetry and Constraint Satisfaction Problems (2005)Google Scholar
- 12.Prestwich, S.D., Beck, J.C.: Exploiting Dominance in Three Symmetric Problems. In: Proc. of the 4th International Workshop on Symmetry and Constraint Satisfaction Problems, pp. 63–70 (2004)Google Scholar