In the resource-constrained project scheduling problem with alternative subgraphs (RCPSP-
AS), we model alternative execution modes for work packages in the project. In contrast to …

In this paper, the berth allocation problem with stochastic vessel handling times is
formulated as a bi-objective problem. To solve the resulting problem, an evolutionary …

The problem studied here entails inserting a new operation into an existing predictive
schedule (preschedule) on a (non-preemptive) single machine by rescheduling its …

Many scheduling problems in practice involve rescheduling of disrupted schedules. In this
study, we show that in contrast to fixed processing times, if we have the flexibility to control …

This article studies the scheduling of buffer times in a single-machine environment. A buffer
time is a machine idle time in between two consecutive jobs and is a common tool to protect …

Many applications have a mixed-criticality nature. They contain tasks with a different
criticality, meaning that a task with a lower criticality can be skipped if a task with a higher …

I would not have been able to complete this doctoral thesis without the help and support of
the very kind people around me. First and foremost, I'd like to express my gratitude to my …

This paper presents a hybrid meta-heuristic search procedure to solve the well-known single
machine scheduling problem to minimize the maximum lateness over all jobs, where …

This paper introduces a novel scheduling problem, where jobs occupy a triangular shape on
the time line. This problem is motivated by scheduling jobs with different criticality levels. A …

This paper focuses on robust job shop scheduling problems in an evolutionary environment.
The schedule is adapted in a reactive manner all along the production process by allowing a …