Inter-Array Cable installation: Optimization of the support vessel fleet composition

In the competitive offshore wind installation market, contractors like DEME strive to optimize operations. This thesis centers on the optimization of the support vessel fleet composition, which consist of a num- ber of walk to work vessels, and are a crucial part of inter-array cable installation. By fine-tuning this composition, operational...

Augmenting VSIDS heuristic for the RCPSP/t by initializing activity values using domain-specific information

The Variable State Independent Decaying Sum (VSIDS) heuristic is one of the most effective variable selection heuristics for Conflict-Driven Clause-Learning (CDCL) SAT solvers. It works by keeping track of the activity values for each variable, which get bumped and decayed based on conflict analysis. These activity values usually start out...

Integration of variable selection heuristics into a MaxSAT solver for solving the multi-mode resource-constrained project scheduling problem

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...

Evaluating an RCPSP Implementation of Quantum Program Scheduling

The goal of quantum application scheduling is to enable the execution of applications on a quantum network. As the final step in the application scheduling process, program scheduling locally schedules execution of blocks of instructions on each node by defining so-called node schedules. In this thesis, we present a formal definition of program...

Heuristic Augmentation of SAT Solvers for MRCPSP

The multi-mode resource-constrained project scheduling problem (MRCPSP) is an NP-hard scheduling problem that concerns activities with several execution modes connected by precedence relations. Precedence relations define a partial ordering in which activities must be processed. The execution mode of an activity defines its processing time and...

Exploring Heuristic Methods for the Resource-Constrained Project Scheduling Problem with Logical Constraints

This paper presents the use of a heuristic solution method to improve the process of creating a conjunctive normal form (CNF) encoding of and finding optimal solutions to instances of the resource-constrained project scheduling problem with logical constraints (RCPSP-Log).<br/><br/>The RCPSP is an optimisation problem consisting of a set of...

Resource-constraint project scheduling with task preemption and setup times by Boolean satisfiability encoding and satisfiability (SAT) solver

Scheduling has been subject to much research. The resource-constrained project scheduling problem (RCPSP) is no exception. With the multiple different variations and additions to the standard definition that are possible, many exact, heuristic and meta-heuristic approaches have been proposed. One of those variations is allowing tasks in the...

Dynamic Time-Division Multiple Access in Noisy Intermediate-Scale Quantum Networks

Quantum networks are networks composed of quantum processors that facilitate the exchange of information in the form of quantum bits, also called qubits. Qubits observe a physical phenomenon known as entanglement that enables the transmission of quantum information over long distances as well as the realization of novel protocols and...

Work Task Order Optimization in Aircraft Hangar Maintenance: A Constraint-Based Heuristic Programming Approach

Scheduled aircraft maintenance consists of a set of work tasks to be executed. This thesis focuses on improving the order in which these work tasks are executed. Because finding an optimum for these kind of problems is computationally intensive, the chosen approach is of heuristic nature, which is a practical method resulting in close-to-optimal...

Robust Solutions for the Resource-Constrained Project Scheduling Problem: Understanding and Improving Robustness in Partial Order Schedules produced by the Chaining algorithm

Robustness is essential for schedules if they are being executed under uncertain conditions. In this thesis we research robustness in Partial Order Schedules, which represent sets of solutions for instances of the Resource-Constrained Project Scheduling Problem. They can be generated using a greedy procedure called Chaining, which can be easily...

NedTrain Planner: Construeren van Flexibele Roosters

Het bedrijf NedTrain beschikt over software om roosterproblemen op te lossen. De wens van NedTrain en het doel van dit project is om deze software uit te breiden met de functionaliteit om flexibele schema's te berekenen. Deze roosterproblemen hebben te maken met het probleem dat ook wel bekend staat als het Resource Constrained Project...

Improving PCP algorithms using flexibility metrics: Creating flexible schedules for Technical Maintenance

In this work we improve on existing scheduling techniques suitable for scheduling problems at the train maintenance provider, NedTrain. Scheduling problems that require flexible solutions can be modeled using variations of the Resource Constraint Project Scheduling Problem (RCPSP), which can be solved using Precedence Constraint Posting (PCP)....