Tighter bound for MULTIFIT scheduling on uniform processors.

Published in: Discret. Appl. Math. (1991)

Keyphrases

upper bound
lower bound
list scheduling
parallel processors
multiprocessor systems
communication delays
scheduling problem
parallel algorithm

scheduling algorithm
parallel machines
single processor
parallel processing
worst case
branch and bound algorithm
resource constraints
control theory

parallel computing
branch and bound
shared memory
precedence constraints
round robin
parallel architectures
real time database systems
resource allocation

np hard
neural network
vc dimension
search problems
parallel computers
precedence relations
special case
objective function