Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines.
Lisa FleischerZhenghui WangPublished in: SAGT (2011)
Keyphrases
- lower bound
- upper bound
- np hard
- branch and bound
- lower and upper bounds
- optimal solution
- flowshop
- worst case
- scheduling problem
- branch and bound algorithm
- objective function
- constant factor
- processing times
- approximation algorithms
- search algorithm
- multi objective
- decision making
- linear programming relaxation
- partition function
- neural network