Computing the expected makespan of task graphs in the presence of silent errors.

Henri Casanova Julien Herrmann Yves Robert

Published in: Parallel Comput. (2018)

Keyphrases

scheduling problem
processing times
graph theoretic
neural network
lower bound
single machine
graph theory
scheduling jobs
data sets
graph structures
graph kernels
error analysis
undirected graph
graph databases
graph structure
bipartite graph
flowshop