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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)
Baptiste, Ph., Peridy, L., Pinson, E.: A Branch and Bound to Minimize the Number of Late Jobs on a Single Machine with Release Time Constraints. European Journal of Operational Research 144(1), 1–11 (2003)
Demeulemeester, E.L., Herroelen, W.S.: Project Scheduling: A Research Handbook. Kluwer Academic Publishers, Dordrecht (2002)
Hopcroft, J.E., Tarjan, R.E.: A V 2 Algorithm for Determining Isomorphism of Planar Graphs. Information Processing Letters 1, 32–34 (1971)
Jenner, B., Köbler, J., McKenzie, P., Torán, J.: Completeness Results for Graph Isomorphism. Journal of Computer and System Sciences 66(3), 549–566 (2003)
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/
Kovács, A., Váncza, J.: Completable Partial Solutions in Constraint Programming and Constraint-based Scheduling. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 332–346. Springer, Heidelberg (2004)
Luks, E.: Isomorphism of Bounded Valence Can Be Tested in Polynomial Time. Journal of Computer and System Sciences 25, 42–46 (1982)
Mastor, A.A.: An Experimental and Comparative Evaluation of Production Line Balancing Techniques. Management Science 16, 728–746 (1970)
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)
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)
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)
Váncza, J., Kis, T., Kovács, A.: Aggregation – The Key to Integrating Production Planning and Scheduling. CIRP Annals – Manufacturing Technology 53(1), 377–380 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kovács, A., Váncza, J. (2006). Progressive Solutions: A Simple but Efficient Dominance Rule for Practical RCPSP. In: Beck, J.C., Smith, B.M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2006. Lecture Notes in Computer Science, vol 3990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11757375_13
Download citation
DOI: https://doi.org/10.1007/11757375_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34306-6
Online ISBN: 978-3-540-34307-3
eBook Packages: Computer ScienceComputer Science (R0)