Knig Jean-Claude

Jean-Claude Knig

Information about the author Jean-Claude Knig will soon be added to the site.
Found 2 papers in total
Scheduling in the presence of processor networks : complexity and approximation
Scheduling in the presence of processor networks : complexity and approximation
2012
In this paper, we study the problem of makespan minimization for the multiprocessor...
On the complexity of scheduling with large communication delays
On the complexity of scheduling with large communication delays
1996
Given a directed acyclic graph (DAG) with unit execution time tasks and constant...
Papers per page: