1 citations · 1 across the 4 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2020
Total Completion Time Minimization for Scheduling with Incompatibility Cliques
Klaus Jansen, Alexandra Lassota, Marten Maack +1
This paper considers parallel machine scheduling with incompatibilities between jobs. The jobs form a graph and no two jobs connected by an edge are allowed to be assigned to the s…
cs.CC2019★ 1 cited
Inapproximability Results for Scheduling with Interval and Resource Restrictions
Marten Maack, Klaus Jansen
In the restricted assignment problem, the input consists of a set of machines and a set of jobs each with a processing time and a subset of eligible machines. The goal is to find a…