Integrated Optimization of Timetabling and Electric Vehicle Scheduling: A Case Study of Aachen, Germany

We tackle the integrated planning problem of periodic timetabling and electric vehicle scheduling, crucial for cities transitioning to electric bus fleets. Given existing timetables, we allow only minor modifications and propose an iterative solution approach that addresses the Electric Vehicle Scheduling Problem (EVSP) in each iteration. Due to the NP-hard nature of EVSP, we employ … Read more

Complexity of the Directed Robust b-matching Problem and its Variants on Different Graph Classes

The b-matching problem is a well-known generalization of the classical matching problem with various applications in operations research and computer science. Given an undirected graph, each vertex v has a capacity b(v), indicating the maximum number of times it can be matched, while edges can also be used multiple times. The problem is solvable in … Read more

Robust Two-Dose Vaccination Schemes and the Directed b-Matching Problem

In light of the recent pandemic and the shortage of vaccinations during their roll-out, questions arose regarding the best strategy to achieve immunity throughout the population by adjusting the time gap between the two necessary vaccination doses. This strategy has already been studied from different angles by various researches. However, the deliveries of vaccination doses … Read more

Γ-robust Optimization of Project Scheduling Problems

In this paper, we investigate the problem of finding a robust baseline schedule for the project scheduling problem under uncertain process times. We assume that the probability distribution for the duration is unknown but an estimation together with an interval in which this time can vary is given. At most $ \Gamma $ of the … Read more