A New Lower Bound for Deterministic Truthful Scheduling.

Yiannis Giannakopoulos Alexander Hammerl Diogo Poças

Published in: Algorithmica (2021)

Keyphrases

lower bound
randomized algorithms
upper bound
branch and bound algorithm
scheduling problem
np hard
precedence constraints
objective function

worst case
scheduling algorithm
branch and bound
lower and upper bounds
optimal solution
parallel machines
flexible manufacturing systems

round robin
lower bounding
resource allocation
dynamic scheduling
randomized algorithm
polynomial approximation
mechanism design

linear programming relaxation
black box
real time database systems
competitive ratio
special case
database systems
parallel processors