1 paper
Kilian Grage, Klaus Jansen, Felix Ohnesorge
In the moldable job scheduling problem one has to assign a set of n jobs to m machines, in order to minimize the time it takes to process all jobs. Each job is moldable, so it…