A New Lower Bound for Deterministic Truthful Scheduling.
Yiannis GiannakopoulosAlexander HammerlDiogo PoçasPublished in: SAGT (2020)
Keyphrases
- lower bound
- upper bound
- randomized algorithms
- scheduling problem
- scheduling algorithm
- np hard
- branch and bound
- branch and bound algorithm
- upper and lower bounds
- worst case
- flexible manufacturing systems
- lower bounding
- lower and upper bounds
- optimal solution
- randomized algorithm
- dynamic scheduling
- resource allocation
- objective function
- mechanism design
- online algorithms
- round robin
- polynomial approximation
- neural network
- real time database systems
- sufficiently accurate
- resource constraints
- release dates
- precedence constraints
- knapsack problem
- single machine
- genetic algorithm