Print Email Facebook Twitter Integration of variable selection heuristics into a MaxSAT solver for solving the multi-mode resource-constrained project scheduling problem Title Integration of variable selection heuristics into a MaxSAT solver for solving the multi-mode resource-constrained project scheduling problem Author Tsvetkov, Denis (TU Delft Electrical Engineering, Mathematics and Computer Science; TU Delft Algorithmics) Contributor Demirović, E. (mentor) Sidorov, K. (mentor) Flippo, M.L. (mentor) Decouchant, Jérémie (graduation committee) Degree granting institution Delft University of Technology Programme Computer Science and Engineering Project CSE3000 Research Project Date 2023-07-04 Abstract The multi-mode resource-constrained project scheduling problem (MRCPSP) is an extension of the resource-constrained project scheduling problem (RCPSP), which allows activities to be executed in multiple modes. The state-of-the-art solutions for solving this NP-Hard problem are dedicated algorithms and (meta-)heuristics. However, this paper considers a more flexible approach using a MaxSAT solver. The idea is to replace the existing variable selection strategy of the solver, Variable State Independent Decaying Sum (VSIDS), with two scheduling heuristics, Earliest Starting Time (EST) and Shortest Feasible Mode (SFM). We examine that combining the three heuristics results in a more efficient solver. In contrast, scheduling rules alone lead to a solver that performs significantly worse on any of the chosen metrics and benchmarks. Subject AlgorithmSchedulingHeuristicRCPSPMRCPSPMaxSAT To reference this document use: http://resolver.tudelft.nl/uuid:0c85f1d6-5471-42e7-9794-091ff7b40c40 Part of collection Student theses Document type bachelor thesis Rights © 2023 Denis Tsvetkov Files PDF Integration_of_variable_s ... MRCPSP.pdf 307.91 KB Close viewer /islandora/object/uuid:0c85f1d6-5471-42e7-9794-091ff7b40c40/datastream/OBJ/view