Login / Signup
Lower bound algorithms for multiprocessor task scheduling with ready times.
Massimiliano Caramia
Paolo Dell'Olmo
Antonio Iovanella
Published in:
Int. Trans. Oper. Res. (2005)
Keyphrases
</>
lower bound
orders of magnitude
worst case
upper bound
significant improvement
data structure
learning algorithm
objective function
computational complexity
times faster
convergence rate
branch and bound algorithm