1 citations · 2 across the 7 of their papers we have counts for
Showing 2020Show 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.DS2020
Solving Packing Problems with Few Small Items Using Rainbow Matchings
Max Bannach, Sebastian Berndt, Marten Maack +4
An important area of combinatorial optimization is the study of packing and covering problems, such as Bin Packing, Multiple Knapsack, and Bin Covering. Those problems have been st…