activity
20172020
most citedApproximation Algorithms and LP Relaxations for Scheduling Problems Related to Min-Sum Set Cover

2 citations · 2 across the 4 of their papers we have counts for

collaborators
Showing cs.DMShow all

2 papers · 1 filter

cs.DM2019

Makespan Minimization with OR-Precedence Constraints

Felix Happach

We consider a variant of the NP-hard problem of assigning jobs to machines to minimize the completion time of the last job. Usually, precedence constraints are given by a partial o…

cs.DM2019

Budget Minimization with Precedence Constraints

Marinus Gottschau, Felix Happach, Marcus Kaiser +1

Budget Minimization is a scheduling problem with precedence constraints, i.e., a scheduling problem on a partially ordered set of jobs . A job is available f…