Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays.

Konstantinos Kalpakis Yaacov Yesha

Published in: Algorithmica (1999)

Keyphrases

upper and lower bounds
lower bound
scheduling problem
upper bound
lower and upper bounds
directed acyclic graph
tree structure
optimal solution
flowshop
sample complexity
dnf formulas
tight upper and lower bounds
branch and bound
reinforcement learning
processing times