Print Email Facebook Twitter Why Midas would be a terrible secretary Title Why Midas would be a terrible secretary: Using a greedy approach to enhance SAT for the Preemptive Resource-Constrained project scheduling problem with set up time Author Hellouin de Ménibus, George (TU Delft Electrical Engineering, Mathematics and Computer Science) Contributor Demirović, E. (mentor) Flippo, M.L. (mentor) Sidorov, K. (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 This paper presents a new greedy heuristic to extend SAT Solvers when solving the Preemptive resource-constrained project scheduling problem (PRCPSP-ST). The heuristic uses domain-specific knowledge to generate a fixed order of variable selection. We also extend previous work into encoding PRCPSP-ST by providing an alternative upper bound. The heuristic was tested against VSDIS on the J12 dataset. These experiments show that it performed, on average, six times slower than VSDIS. To reference this document use: http://resolver.tudelft.nl/uuid:b7854feb-e6b2-43ba-8b7c-ae97abb41f1b Part of collection Student theses Document type bachelor thesis Rights © 2023 George Hellouin de Ménibus Files PDF Final_Paper_4.pdf 193.72 KB Close viewer /islandora/object/uuid:b7854feb-e6b2-43ba-8b7c-ae97abb41f1b/datastream/OBJ/view