Lower-bound complexity algorithm for task scheduling on heterogeneous grid.

Asmaa Atef Tarek Hagras Yousef B. Mahdy Jan Janecek

Published in: Computing (2017)

Keyphrases

lower and upper bounds
lower bound
upper bound
worst case
branch and bound algorithm
np hard
objective function
competitive ratio
detection algorithm
memory requirements
space complexity
optimal solution
experimental evaluation
dynamic programming
resource allocation
preprocessing
computational complexity