activity
20092022
most citedRobust Single Machine Makespan Scheduling with Release Date Uncertainty

19 citations · 61 across the 20 of their papers we have counts for

collaborators
Showing 2020Show all

5 papers · 1 filter

math.CO2020★ 1 cited

On the Bicriterion Maximum Flow Network Interdiction Problem

Luca E. Schäfer, Stefan Ruzika, Sven O. Krumke +1

This article focuses on a biobjective extension of the maximum flow network interdiction problem, where each arc in the network is associated with two capacity values. Two maximum…

math.CO2020★ 3 cited

Towards obtaining a 3-Decomposition from a perfect Matching

Oliver Bachtler, Sven O. Krumke

A decomposition of a graph is a set of subgraphs whose edges partition those of . The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected c…

math.OC2020★ 19 cited

Robust Single Machine Makespan Scheduling with Release Date Uncertainty

Oliver Bachtler, Sven O. Krumke, Huy Minh Le

This paper addresses the robust single machine makespan scheduling with uncertain release dates of the jobs. The release dates take values within know intervals. We use the concept…

cs.DS2020★ 6 cited

Scheduling a Proportionate Flow Shop of Batching Machines

Christoph Hertrich, Christian Weiß, Heiner Ackermann +2

In this paper we study a proportionate flow shop of batching machines with release dates and a fixed number of machines. The scheduling problem has so far barely receive…

cs.DS2020★ 3 cited

Online Algorithms to Schedule a Proportionate Flexible Flow Shop of Batching Machines

Christoph Hertrich, Christian Weiß, Heiner Ackermann +2

This paper is the first to consider online algorithms to schedule a proportionate flexible flow shop of batching machines (PFFB). The scheduling model is motivated by manufacturing…