1 citations · 1 across the 4 of their papers we have counts for
1 paper · 1 filter
Klaus Jansen, Marten Maack, Roberto Solis-Oba
We consider scheduling on identical and unrelated parallel machines with job assignment restrictions. These problems are NP-hard and they do not admit polynomial time approximation…