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

Scheduling with release times and deadlines

We study the single machine version of the task scheduling problem with release times and deadlines. This problem is too simple to be of practical importance in itself, but it is also used as a relaxation in algorithms for the Job Shop scheduling problem, which is a more practical task scheduling problem. We study exact algorithms for solving...

Maximal Flexibility and Optimal Decoupling in Task Scheduling Problems

This thesis focuses on the properties of (multi-agent) task scheduling instances represented as Simple Temporal Problems (STP). By defining a subclass STP$_{\prec}$ of STPs that contain these task scheduling instances, existing algorithms for arbitrary STPs can be improved if applied to task scheduling STPs, allowing arbitrary schedules and...

Visualisatie en ondersteuning bij planning en scheduling

Dit verslag is het resultaat van het bachelorproject van onze studie Technische Informatica aan de Technische Universiteit Delft. Bij dit project is het de bedoeling om de aangeleerde concepten en ontwikkelmethoden toe te passen in een realistisch project. Hierbij dient het volledige proces van softwareontwikkeling te worden doorlopen. Tevens is...

Algorithms for Scheduling of Train Maintenance

In this thesis we will develop algorithms for the scheduling of train maintenance at NedTrain facilities. We present a detailed analysis of the maintenance process at NedTrain. The problem of scheduling train maintenance is formalized and expressed using linear inequalities. We show that the Simple Temporal Problem can be used to find schedules...