The paper investigates the static dial-a-ride problem with ride and waiting time minimization. This is a new problem setting of significant practical relevance because several ride-sharing providers launched in recent years in large European cities. In contrast to the standard dial-a-ride...

We consider a scheduling problem where a set of known jobs needs to be assigned to a set of given parallel resources such that the expected waiting time for a set of uncertain emergency jobs is kept as small as possible. On the basis of structural insights from queuing theory, we develop...

Abstract The Maximally Diverse Grouping Problem is one of the well-known combinatorial optimization problems with applications in the assignment of students to groups or courses. Due to its NP-hardness several (meta)heuristic solution approaches have been presented in the literature. Most of...