TopMath Talk with Alexander Armbruster: Approximation Algorithms for Scheduling Problems

„Approximation algorithms provide a way to efficiently find near-optimal solutions to problems that are computationally intractable.  I focus on a problem called throughput maximization. There, the input consists of n jobs, each with a processing time and a time window, and the goal is to schedule as many jobs as possible non-preemptively on a single machine without overlap. Despite its simple formulation, the complexity of the problem is not known. I present recent developments for this problem in terms of approximation algorithms.“

TopMath Talks

As part of the TopMath talks, TopMath students and doctoral students present parts of their research. They provide an understandable insight into their current area of interest, enabling students and staff from different research fields to broaden their mathematical background knowledge. The talks are open to the public and last about an hour, followed by discussion. You are cordially invited!