This repository is part of the Research Project (2022) of TU Delft. The implementations were written for a bachelor thesis on "SAT-based optimisation for the resource-constrained project scheduling problem with time-dependent resource capacities and requests" by Jelle Pleunes, supervised by Emir Demirović.
Implementation of a tournament heuristic using a priority rule, for solving the RCPSP/t (Resource-Constrained Project Scheduling Problem with Time-Dependent Resource Capacities and Requests).
This is my own implementation of the heuristic algorithm as it is described in a 2013 paper by Sönke Hartmann:
S. Hartmann.
"Project scheduling with resource capacities and requests varying with time: a case study".
In: Flexible Services and Manufacturing Journal 25 (2013), pp. 74-93.
URL: https://doi.org/10.1007/s10696-012-9141-8.
Test instances that can be parsed by this implementation can be downloaded from http://www.om-db.wi.tum.de/psplib/newinstances.html. These instances were generated by Hartmann (2013).