A heuristic-guided constraint programming approach to PRCPSP-ST

Using priority-rules to guide constraint solvers

Bachelor thesis (2024)

Authors

C. Ogreanu Electrical Engineering, Mathematics and Computer Science

Contributors

E. Demirović Algorithmics - EEMCS (mentor)
M.L. Flippo Algorithmics - EEMCS (mentor)
I.C.W.M. Marijnissen Algorithmics - EEMCS (mentor)
Julia Olkhovskaya Sequential Decision Making - EEMCS (graduation committee member)
Faculty
Electrical Engineering, Mathematics and Computer Science
Constraint Programming (CP) RCPSP VSIDS Preemptive tasks Priority rule
More Info
expand_more

Published Date

26-06-2024

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

This paper introduces a new approach to the Preemptive Resource Constrained Project Scheduling Problem with setup times. The method makes use of a Constraint Optimization Problem solver, which has been modified to use priority-rule-based heuristics in its variable and value selection procedures. An alternative implementation which uses a combination of a priority-rule heuristic and a domain-independent solver heuristic has also been investigated. Both methods were tested on four well-known problem sets against a problem-independent solver configuration. Experimental results show a significant reduction in the time needed to find optimal solutions for the new methods.