Envy-free makespan approximation: extended abstract.

Edith Cohen Michal Feldman Amos Fiat Haim Kaplan Svetlana Olonetsky

Published in: EC (2010)

Keyphrases

extended abstract
envy free
scheduling problem
pareto optimal
lower bound
flowshop
resource allocation
approximation algorithms
optimal solution
computational complexity
evolutionary algorithm
np hard
upper bound
sufficient conditions
single machine