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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3990 LNCS, Issue , 2006, Pages 139-151

  Kovács, András ^a,b   Váncza, József ^a  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; INTEGRATION; OPTIMIZATION;

INDUSTRIAL PROBLEM; PRACTICAL RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEMS (RCPSP; PRIORI; PROGRESSIVE SOLUTIONS;

PROBLEM SOLVING;

EID: 33746091666     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11757375_13     Document Type: Conference Paper

References (13)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
2. Ph. Baptiste, L. Peridy, and E. Pinson. 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), pp. 1-11, 2003.
3. E.L. Demeulemeester and W.S. Herroelen. Project Scheduling: A Research Handbook. Kluwer Academic Publishers, 2002.
4. 2 Algorithm for Determining Isomorphism of Planar Graphs. Information Processing Letters 1, pp. 32-34, 1971.
5. B. Jenner, J. Köbler, P. McKenzie, and J. Torán. Completeness Results for Graph Isomorphism. Journal of Computer and System Sciences 66(3), pp. 549-566, 2003.
6. A. Kovács. 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/
7. A. Kovács and J. Váncza. Completable Partial Solutions in Constraint Programming and Constraint-based Scheduling. In Proc. of the 10th International Conference on Principles and Practice of Constraint Programming, Springer LNCS 3258, pp. 332-346, 2004.
8. E. Luks. Isomorphism of Bounded Valence Can Be Tested in Polynomial Time. Journal of Computer and System Sciences 25, pp. 42-46, 1982.
9. A.A. Mastor. An Experimental and Comparative Evaluation of Production Line Balancing Techniques. Management Science 16, pp. 728-746, 1970.
10. W. Nuijten, T. Bousonville, F. Focacci, D. Godard, and C. Le Pape. 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.
11. K.E. Petrie and B.M. Smith. Comparison of Symmetry Breaking Methods in Constraint Programming. In Proc. of the 5th International Workshop on Symmetry and Constraint Satisfaction Problems, 2005.
12. S.D. Prestwich and J.C. Beck. Exploiting Dominance in Three Symmetric Problems. In Proc. of the 4th International Workshop on Symmetry and Constraint Satisfaction Problems, pp. 63-70, 2004.
13. J. Váncza, T. Kis, and A. Kovács. Aggregation - The Key to Integrating Production Planning and Scheduling. CIRP Annals - Manufacturing Technology 53(1), pp. 377-380, 2004.