Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items.

Enrico Angelelli Maria Grazia Speranza Zsolt Tuza

Published in: Algorithmica (2003)

Keyphrases

parallel processors
upper bound
lower bound
precedence constraints
branch and bound algorithm
single processor
worst case
search problems
contract algorithms
branch and bound
special case
np hard
genetic algorithm
scheduling problem
partial order
constant factor